%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL180-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:07:01 PM UTC 2026
% Result : Unsatisfiable 1.57s 0.84s
% Output : CNFRefutation 1.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 25 unt; 0 def)
% Number of atoms : 65 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 50 ( 28 ~; 22 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 77 ( 77 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A] : axiom(implies(or(A,A),A)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [A,B] : axiom(implies(A,or(B,A))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A,B] : axiom(implies(or(A,B),or(B,A))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B,C] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X,Y] : implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X] :
( ~ axiom(X)
| theorem(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,Y] :
( ~ theorem(Y)
| ~ theorem(implies(Y,X))
| theorem(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
~ theorem(implies(not(not(p)),p)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,plain,
! [X0] : axiom(implies(or(X0,X0),X0)),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f11,plain,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f12,plain,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f13,plain,
! [X0,X1,X2] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f14,plain,
! [X0,X1,X2] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f15,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f16,plain,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f17,plain,
! [Y] :
( ~ theorem(Y)
| ! [X] :
( ~ theorem(implies(Y,X))
| theorem(X) ) ),
inference(miniscoping,[status(thm)],[f8]) ).
fof(f18,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(implies(X1,X0))
| theorem(X0) ),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f19,plain,
~ theorem(implies(not(not(p)),p)),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f20,plain,
! [X0,X1] : theorem(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[f11,f16]) ).
fof(f36,plain,
! [X0] : theorem(implies(or(X0,X0),X0)),
inference(resolution,[status(thm)],[f10,f16]) ).
fof(f38,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[f36,f18]) ).
fof(f44,plain,
! [X0,X1] : theorem(implies(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[f12,f16]) ).
fof(f47,plain,
! [X0,X1,X2] : theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[f13,f16]) ).
fof(f56,plain,
! [X0,X1,X2] : theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(resolution,[status(thm)],[f14,f16]) ).
fof(f61,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f44,f18]) ).
fof(f63,plain,
! [X0,X1] : theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(paramodulation,[status(thm)],[f15,f44]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[f47,f18]) ).
fof(f87,plain,
! [X0,X1,X2] :
( ~ theorem(implies(X1,X2))
| theorem(implies(or(X0,X1),or(X0,X2))) ),
inference(resolution,[status(thm)],[f56,f18]) ).
fof(f94,plain,
! [X0,X1] :
( ~ theorem(implies(X1,X0))
| theorem(or(X0,not(X1))) ),
inference(paramodulation,[status(thm)],[f15,f61]) ).
fof(f97,plain,
! [X0,X1] :
( ~ theorem(or(X1,not(X0)))
| theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f63,f18]) ).
fof(f101,plain,
! [X0,X1,X2] :
( ~ theorem(implies(X1,or(X0,X2)))
| theorem(or(X0,or(not(X1),X2))) ),
inference(paramodulation,[status(thm)],[f15,f68]) ).
fof(f103,plain,
! [X0,X1,X2] :
( ~ theorem(implies(X1,or(X0,X2)))
| theorem(or(X0,implies(X1,X2))) ),
inference(forward_demodulation,[status(thm)],[f15,f101]) ).
fof(f116,plain,
! [X0,X1,X2] :
( ~ theorem(or(X2,X0))
| theorem(or(X2,X1))
| ~ theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f87,f18]) ).
fof(f128,plain,
! [X0,X1] :
( ~ theorem(implies(X1,not(X0)))
| theorem(implies(X0,not(X1))) ),
inference(paramodulation,[status(thm)],[f15,f94]) ).
fof(f130,plain,
~ theorem(or(p,not(not(not(p))))),
inference(resolution,[status(thm)],[f97,f19]) ).
fof(f139,plain,
! [X0,X1] :
( theorem(implies(X0,X1))
| ~ theorem(implies(X0,or(implies(X0,X1),X1))) ),
inference(resolution,[status(thm)],[f103,f38]) ).
fof(f162,plain,
! [X0] :
( ~ theorem(or(p,X0))
| ~ theorem(implies(X0,not(not(not(p))))) ),
inference(resolution,[status(thm)],[f130,f116]) ).
fof(f180,plain,
! [X0] :
( ~ theorem(implies(not(not(p)),not(X0)))
| ~ theorem(or(p,X0)) ),
inference(resolution,[status(thm)],[f162,f128]) ).
fof(f238,plain,
! [X0] : theorem(implies(X0,X0)),
inference(resolution,[status(thm)],[f139,f20]) ).
fof(f347,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[status(thm)],[f94,f238]) ).
fof(f449,plain,
~ theorem(or(p,not(p))),
inference(resolution,[status(thm)],[f180,f238]) ).
fof(f1433,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f449,f347]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL180-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.50 % Computer : n008.cluster.edu
% 0.09/0.50 % Model : x86_64 x86_64
% 0.09/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.50 % Memory : 8046.5625MB
% 0.09/0.50 % OS : Linux 6.8.0-71-generic
% 0.09/0.50 % CPULimit : 300
% 0.09/0.50 % WCLimit : 300
% 0.09/0.50 % DateTime : Mon Sep 21 00:09:40 UTC 2026
% 0.09/0.51 % CPUTime :
% 0.09/0.52 % Drodi V4.1.1
% 1.57/0.84 % Refutation found
% 1.57/0.84 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 1.57/0.84 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 1.57/0.87 % Elapsed time: 0.352014 seconds
% 1.57/0.87 % CPU time: 2.529255 seconds
% 1.57/0.87 % Total memory used: 102.030 MB
% 1.57/0.87 % Net memory used: 95.721 MB
%------------------------------------------------------------------------------