%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL261-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 : n016.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:20 PM UTC 2026
% Result : Unsatisfiable 67.46s 9.23s
% Output : CNFRefutation 67.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 34 unt; 0 def)
% Number of atoms : 69 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 48 ( 27 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 97 ( 97 !; 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,axiom,
! [P,Q] : and(P,Q) = not(or(not(P),not(Q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,negated_conjecture,
~ theorem(or(not(p),or(not(q),and(p,q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,plain,
! [X0] : axiom(implies(or(X0,X0),X0)),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f12,plain,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f13,plain,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f14,plain,
! [X0,X1,X2] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f15,plain,
! [X0,X1,X2] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f16,plain,
! [X0,X1] : or(not(X0),X1) = implies(X0,X1),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f17,plain,
! [X0] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f18,plain,
! [Y] :
( ~ theorem(Y)
| ! [X] :
( ~ theorem(implies(Y,X))
| theorem(X) ) ),
inference(miniscoping,[status(thm)],[f8]) ).
fof(f19,plain,
! [X0,X1] :
( ~ theorem(implies(X0,X1))
| theorem(X1)
| ~ theorem(X0) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f20,plain,
! [X0,X1] : not(or(not(X0),not(X1))) = and(X0,X1),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f21,plain,
~ theorem(or(not(p),or(not(q),and(p,q)))),
inference(cnf_transformation,[status(thm)],[f10]) ).
fof(f22,plain,
~ theorem(or(not(p),implies(q,and(p,q)))),
inference(backward_demodulation,[status(thm)],[f16,f21]) ).
fof(f23,plain,
~ theorem(implies(p,implies(q,and(p,q)))),
inference(forward_demodulation,[status(thm)],[f16,f22]) ).
fof(f24,plain,
! [X0,X1,X2] : axiom(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(paramodulation,[status(thm)],[f16,f14]) ).
fof(f26,plain,
! [X0,X1,X2] : axiom(implies(or(X0,or(not(X1),X2)),implies(X1,or(X0,X2)))),
inference(paramodulation,[status(thm)],[f16,f14]) ).
fof(f28,plain,
! [X0,X1,X2] : axiom(implies(or(X0,implies(X1,X2)),implies(X1,or(X0,X2)))),
inference(forward_demodulation,[status(thm)],[f16,f26]) ).
fof(f29,plain,
! [X0,X1,X2] : axiom(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(forward_demodulation,[status(thm)],[f16,f24]) ).
fof(f33,plain,
! [X0,X1] : axiom(implies(or(X0,not(X1)),implies(X1,X0))),
inference(paramodulation,[status(thm)],[f16,f13]) ).
fof(f35,plain,
! [X0,X1] :
( ~ theorem(X0)
| theorem(X1)
| ~ axiom(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f17,f19]) ).
fof(f38,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_demodulation,[status(thm)],[f16,f20]) ).
fof(f40,plain,
! [X0,X1,X2] : or(and(X0,X1),X2) = implies(implies(X0,not(X1)),X2),
inference(paramodulation,[status(thm)],[f38,f16]) ).
fof(f41,plain,
! [X0,X1,X2] : axiom(implies(implies(X0,X1),implies(implies(X2,X0),or(not(X2),X1)))),
inference(paramodulation,[status(thm)],[f16,f15]) ).
fof(f43,plain,
! [X0,X1,X2] : axiom(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
inference(forward_demodulation,[status(thm)],[f16,f41]) ).
fof(f46,plain,
! [X0,X1,X2] : axiom(implies(or(not(X0),implies(X1,X2)),implies(X1,implies(X0,X2)))),
inference(paramodulation,[status(thm)],[f16,f28]) ).
fof(f47,plain,
! [X0,X1,X2] : axiom(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
inference(forward_demodulation,[status(thm)],[f16,f46]) ).
fof(f49,plain,
! [X0,X1] :
( ~ axiom(X0)
| theorem(X1)
| ~ axiom(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f35,f17]) ).
fof(f57,plain,
! [X0,X1,X2] :
( theorem(or(X1,implies(X0,X2)))
| ~ axiom(implies(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[f29,f49]) ).
fof(f105,plain,
! [X0,X1,X2] :
( theorem(implies(implies(X2,X0),implies(X2,X1)))
| ~ axiom(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f43,f49]) ).
fof(f419,plain,
! [X0,X1,X2,X3] :
( theorem(X3)
| ~ axiom(implies(X1,or(X0,X2)))
| ~ axiom(implies(or(X0,implies(X1,X2)),X3)) ),
inference(resolution,[status(thm)],[f57,f35]) ).
fof(f438,plain,
! [X0,X1,X2] :
( theorem(implies(X2,X1))
| ~ theorem(implies(X2,X0))
| ~ axiom(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f105,f19]) ).
fof(f6377,plain,
! [X0,X1,X2] :
( theorem(X2)
| ~ axiom(implies(or(X0,implies(X1,X1)),X2)) ),
inference(resolution,[status(thm)],[f419,f12]) ).
fof(f6783,plain,
! [X0] :
( ~ axiom(implies(X0,implies(q,and(p,q))))
| ~ theorem(implies(p,X0)) ),
inference(resolution,[status(thm)],[f438,f23]) ).
fof(f7051,plain,
~ theorem(implies(p,or(and(p,q),not(q)))),
inference(resolution,[status(thm)],[f6783,f33]) ).
fof(f7832,plain,
! [X0] : theorem(implies(X0,X0)),
inference(resolution,[status(thm)],[f6377,f11]) ).
fof(f7941,plain,
! [X0,X1] :
( ~ axiom(implies(implies(X1,X1),X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[f7832,f35]) ).
fof(f9124,plain,
! [X0,X1] : theorem(implies(X0,implies(implies(X0,X1),X1))),
inference(resolution,[status(thm)],[f7941,f47]) ).
fof(f9916,plain,
! [X0,X1] : theorem(implies(X0,or(and(X0,X1),not(X1)))),
inference(paramodulation,[status(thm)],[f40,f9124]) ).
fof(f17884,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f7051,f9916]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL261-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n016.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 00:21:23 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.38 % Drodi V4.1.1
% 67.46/9.23 % Refutation found
% 67.46/9.23 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 67.46/9.23 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 34.06/10.56 % Elapsed time: 9.971216 seconds
% 34.06/10.56 % CPU time: 67.417329 seconds
% 34.06/10.56 % Total memory used: 674.751 MB
% 34.06/10.56 % Net memory used: 644.063 MB
%------------------------------------------------------------------------------