%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL237-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 : n006.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:16 PM UTC 2026
% Result : Unsatisfiable 82.43s 20.91s
% Output : CNFRefutation 82.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 23 unt; 0 def)
% Number of atoms : 60 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 58 ( 35 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 6 ( 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 : 70 ( 70 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(implies(q,implies(p,and(p,q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
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(X1)
| ~ theorem(implies(X1,X0))
| theorem(X0) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f20,plain,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f21,plain,
~ theorem(implies(q,implies(p,and(p,q)))),
inference(cnf_transformation,[status(thm)],[f10]) ).
fof(f22,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_demodulation,[status(thm)],[f16,f20]) ).
fof(f24,plain,
! [X0] :
( ~ theorem(implies(X0,implies(q,implies(p,and(p,q)))))
| ~ theorem(X0) ),
inference(resolution,[status(thm)],[f21,f19]) ).
fof(f26,plain,
! [X0,X1] :
( ~ theorem(implies(X1,implies(X0,implies(q,implies(p,and(p,q))))))
| ~ theorem(X1)
| ~ theorem(X0) ),
inference(resolution,[status(thm)],[f24,f19]) ).
fof(f32,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ axiom(implies(X1,implies(X0,implies(q,implies(p,and(p,q))))))
| ~ theorem(X0) ),
inference(resolution,[status(thm)],[f26,f17]) ).
fof(f36,plain,
! [X0,X1,X2] : implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(paramodulation,[status(thm)],[f22,f16]) ).
fof(f51,plain,
! [X0,X1] : axiom(implies(or(X0,not(X1)),implies(X1,X0))),
inference(paramodulation,[status(thm)],[f16,f13]) ).
fof(f88,plain,
! [X0,X1] : axiom(implies(implies(X0,not(X1)),implies(X1,not(X0)))),
inference(paramodulation,[status(thm)],[f16,f51]) ).
fof(f93,plain,
! [X0,X1] : axiom(or(and(X0,X1),implies(X1,not(X0)))),
inference(forward_demodulation,[status(thm)],[f36,f88]) ).
fof(f113,plain,
! [X0,X1,X2] : axiom(implies(or(X0,implies(X1,X2)),or(not(X1),or(X0,X2)))),
inference(paramodulation,[status(thm)],[f16,f14]) ).
fof(f116,plain,
! [X0,X1,X2] : axiom(implies(or(X0,implies(X1,X2)),implies(X1,or(X0,X2)))),
inference(forward_demodulation,[status(thm)],[f16,f113]) ).
fof(f123,plain,
! [X0,X1,X2] : axiom(implies(implies(X0,X1),implies(or(not(X2),X0),implies(X2,X1)))),
inference(paramodulation,[status(thm)],[f16,f15]) ).
fof(f124,plain,
! [X0,X1,X2] : axiom(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
inference(forward_demodulation,[status(thm)],[f16,f123]) ).
fof(f153,plain,
! [X0] :
( ~ theorem(implies(X0,implies(p,and(p,q))))
| ~ theorem(implies(q,X0)) ),
inference(resolution,[status(thm)],[f124,f32]) ).
fof(f179,plain,
! [X0,X1] :
( ~ theorem(implies(X0,implies(q,X1)))
| ~ theorem(implies(X1,implies(p,and(p,q))))
| ~ theorem(X0) ),
inference(resolution,[status(thm)],[f153,f19]) ).
fof(f902,plain,
! [X0,X1] :
( ~ theorem(implies(X1,implies(p,and(p,q))))
| ~ axiom(X0)
| ~ theorem(implies(X0,implies(q,X1))) ),
inference(resolution,[status(thm)],[f179,f17]) ).
fof(f1129,plain,
! [X0,X1] :
( ~ axiom(implies(X1,implies(p,and(p,q))))
| ~ axiom(X0)
| ~ theorem(implies(X0,implies(q,X1))) ),
inference(resolution,[status(thm)],[f902,f17]) ).
fof(f1248,plain,
! [X0,X1] :
( ~ axiom(implies(X0,implies(q,X1)))
| ~ axiom(implies(X1,implies(p,and(p,q))))
| ~ axiom(X0) ),
inference(resolution,[status(thm)],[f1129,f17]) ).
fof(f1356,plain,
! [X0] :
( ~ axiom(implies(X0,implies(q,or(and(p,q),not(p)))))
| ~ axiom(X0) ),
inference(resolution,[status(thm)],[f1248,f51]) ).
fof(f1368,plain,
~ axiom(or(and(p,q),implies(q,not(p)))),
inference(resolution,[status(thm)],[f1356,f116]) ).
fof(f1375,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f1368,f93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL237-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/10.37 % Computer : n006.cluster.edu
% 0.11/10.37 % Model : x86_64 x86_64
% 0.11/10.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.37 % Memory : 8046.5625MB
% 0.11/10.37 % OS : Linux 6.8.0-71-generic
% 0.11/10.37 % CPULimit : 300
% 0.11/10.37 % WCLimit : 300
% 0.11/10.37 % DateTime : Mon Sep 21 00:13:54 UTC 2026
% 0.11/10.37 % CPUTime :
% 0.11/10.38 % Drodi V4.1.1
% 82.43/20.91 % Refutation found
% 82.43/20.91 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 82.43/20.91 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 36.09/22.19 % Elapsed time: 11.602709 seconds
% 36.09/22.19 % CPU time: 79.129536 seconds
% 36.09/22.19 % Total memory used: 651.772 MB
% 36.09/22.19 % Net memory used: 613.472 MB
%------------------------------------------------------------------------------