%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL296-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 : n004.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:23 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.56s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 43 ( 32 unt; 0 def)
% Number of atoms : 57 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 31 ( 17 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 72 ( 72 !; 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(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,axiom,
! [P,Q] : equivalent(P,Q) = and(implies(P,Q),implies(Q,P)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,negated_conjecture,
~ theorem(equivalent(implies(p,not(q)),or(not(p),not(q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,plain,
! [X0] : axiom(implies(or(X0,X0),X0)),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f13,plain,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f14,plain,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f15,plain,
! [X0,X1,X2] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f17,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f18,plain,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f19,plain,
! [Y] :
( ~ theorem(Y)
| ! [X] :
( ~ theorem(implies(Y,X))
| theorem(X) ) ),
inference(miniscoping,[status(thm)],[f8]) ).
fof(f20,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(implies(X1,X0))
| theorem(X0) ),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f21,plain,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f22,plain,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(cnf_transformation,[status(thm)],[f10]) ).
fof(f23,plain,
~ theorem(equivalent(implies(p,not(q)),or(not(p),not(q)))),
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f24,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_demodulation,[status(thm)],[f17,f21]) ).
fof(f25,plain,
~ theorem(equivalent(implies(p,not(q)),implies(p,not(q)))),
inference(forward_demodulation,[status(thm)],[f17,f23]) ).
fof(f27,plain,
! [X0,X1,X2] : implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(paramodulation,[status(thm)],[f24,f17]) ).
fof(f55,plain,
! [X0] : theorem(implies(or(X0,X0),X0)),
inference(resolution,[status(thm)],[f12,f18]) ).
fof(f58,plain,
! [X0,X1] : theorem(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[f13,f18]) ).
fof(f62,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[f55,f20]) ).
fof(f63,plain,
! [X0] : theorem(implies(implies(X0,not(X0)),not(X0))),
inference(paramodulation,[status(thm)],[f17,f55]) ).
fof(f64,plain,
! [X0] : theorem(or(and(X0,X0),not(X0))),
inference(forward_demodulation,[status(thm)],[f27,f63]) ).
fof(f75,plain,
! [X0,X1] : theorem(implies(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[f14,f18]) ).
fof(f80,plain,
! [X0,X1,X2] : theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[f15,f18]) ).
fof(f134,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f75,f20]) ).
fof(f140,plain,
! [X0,X1] :
( ~ theorem(or(X1,not(X0)))
| theorem(implies(X0,X1)) ),
inference(paramodulation,[status(thm)],[f17,f134]) ).
fof(f201,plain,
! [X0] : theorem(implies(X0,and(X0,X0))),
inference(resolution,[status(thm)],[f140,f64]) ).
fof(f208,plain,
! [X0,X1,X2] : theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(paramodulation,[status(thm)],[f17,f80]) ).
fof(f212,plain,
! [X0,X1,X2] : theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(forward_demodulation,[status(thm)],[f17,f208]) ).
fof(f242,plain,
! [X0] :
( ~ theorem(X0)
| theorem(and(X0,X0)) ),
inference(resolution,[status(thm)],[f201,f20]) ).
fof(f251,plain,
! [X0] :
( ~ theorem(implies(X0,X0))
| theorem(equivalent(X0,X0)) ),
inference(paramodulation,[status(thm)],[f22,f242]) ).
fof(f508,plain,
! [X0,X1,X2] :
( ~ theorem(implies(implies(X1,or(X2,X1)),X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[f58,f20]) ).
fof(f1945,plain,
! [X0,X1] : theorem(or(X0,implies(X1,X1))),
inference(resolution,[status(thm)],[f508,f212]) ).
fof(f1970,plain,
! [X0] : theorem(implies(X0,X0)),
inference(resolution,[status(thm)],[f1945,f62]) ).
fof(f1980,plain,
! [X0] : theorem(equivalent(X0,X0)),
inference(backward_subsumption_resolution,[status(thm)],[f251,f1970]) ).
fof(f1993,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f25,f1980]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL296-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 00:19:04 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 % Drodi V4.1.1
% 0.10/0.56 % Refutation found
% 0.10/0.56 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.56 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.95/0.58 % Elapsed time: 0.198072 seconds
% 0.95/0.58 % CPU time: 1.330530 seconds
% 0.95/0.58 % Total memory used: 112.798 MB
% 0.95/0.58 % Net memory used: 111.667 MB
%------------------------------------------------------------------------------