%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL311-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n026.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:24 PM UTC 2026
% Result : Unsatisfiable 26.17s 3.92s
% Output : CNFRefutation 26.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 49 ( 32 unt; 0 def)
% Number of atoms : 70 ( 10 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 44 ( 23 ~; 21 |; 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 : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 96 ( 96 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A] : axiom(implies(or(A,A),A)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [A,B] : axiom(implies(A,or(B,A))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A,B] : axiom(implies(or(A,B),or(B,A))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B,C] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X,Y] : implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X] :
( ~ axiom(X)
| theorem(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,Y] :
( ~ theorem(Y)
| ~ theorem(implies(Y,X))
| theorem(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [P,Q] : and(P,Q) = not(or(not(P),not(Q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [P,Q] : equivalent(P,Q) = and(implies(P,Q),implies(Q,P)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,negated_conjecture,
~ theorem(equivalent(implies(p,not(p)),not(p))),
file('/export/starexec/sandbox2/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(p)),not(p))),
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f24,plain,
! [X0] : theorem(implies(or(X0,X0),X0)),
inference(resolution,[status(thm)],[f12,f18]) ).
fof(f30,plain,
! [X0,X1] : theorem(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[f13,f18]) ).
fof(f33,plain,
! [X0,X1] : theorem(implies(X0,implies(X1,X0))),
inference(paramodulation,[status(thm)],[f17,f30]) ).
fof(f35,plain,
! [X0,X1] : theorem(implies(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[f14,f18]) ).
fof(f38,plain,
! [X0,X1,X2] : theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[f15,f18]) ).
fof(f52,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_demodulation,[status(thm)],[f17,f21]) ).
fof(f56,plain,
! [X0,X1,X2] : implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(paramodulation,[status(thm)],[f52,f17]) ).
fof(f60,plain,
! [X0,X1] : theorem(implies(implies(X0,X1),or(X1,not(X0)))),
inference(paramodulation,[status(thm)],[f17,f35]) ).
fof(f61,plain,
! [X0,X1] : theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(paramodulation,[status(thm)],[f17,f35]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[f38,f20]) ).
fof(f110,plain,
! [X0,X1,X2,X3] : implies(or(and(X0,X1),not(X2)),X3) = or(and(implies(X0,not(X1)),X2),X3),
inference(paramodulation,[status(thm)],[f56,f56]) ).
fof(f139,plain,
! [X0,X1,X2] : equivalent(implies(X0,not(X1)),X2) = and(or(and(X0,X1),X2),implies(X2,implies(X0,not(X1)))),
inference(paramodulation,[status(thm)],[f56,f22]) ).
fof(f140,plain,
! [X0,X1,X2] :
( ~ theorem(implies(X1,not(X2)))
| ~ theorem(or(and(X1,X2),X0))
| theorem(X0) ),
inference(paramodulation,[status(thm)],[f56,f20]) ).
fof(f171,plain,
! [X0,X1] : theorem(or(and(X0,X1),or(not(X1),not(X0)))),
inference(paramodulation,[status(thm)],[f56,f60]) ).
fof(f176,plain,
! [X0,X1] : theorem(or(and(X0,X1),implies(X1,not(X0)))),
inference(forward_demodulation,[status(thm)],[f17,f171]) ).
fof(f180,plain,
! [X0,X1] :
( ~ theorem(or(X1,not(X0)))
| theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f61,f20]) ).
fof(f210,plain,
! [X0,X1,X2] :
( ~ theorem(or(X1,implies(X0,X2)))
| theorem(or(not(X0),or(X1,X2))) ),
inference(paramodulation,[status(thm)],[f17,f70]) ).
fof(f212,plain,
! [X0,X1,X2] :
( ~ theorem(or(X1,implies(X0,X2)))
| theorem(implies(X0,or(X1,X2))) ),
inference(forward_demodulation,[status(thm)],[f17,f210]) ).
fof(f1206,plain,
! [X0,X1] :
( ~ theorem(or(and(or(not(X1),not(X1)),X1),X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[f140,f24]) ).
fof(f1213,plain,
! [X0,X1] :
( ~ theorem(or(and(implies(X1,not(X1)),X1),X0))
| theorem(X0) ),
inference(forward_demodulation,[status(thm)],[f17,f1206]) ).
fof(f1214,plain,
! [X0,X1] :
( ~ theorem(implies(or(and(X1,X1),not(X1)),X0))
| theorem(X0) ),
inference(forward_demodulation,[status(thm)],[f110,f1213]) ).
fof(f1567,plain,
! [X0,X1] : theorem(implies(X0,or(and(X1,X0),not(X1)))),
inference(resolution,[status(thm)],[f212,f176]) ).
fof(f1581,plain,
! [X0,X1] :
( ~ theorem(X1)
| theorem(or(and(X0,X1),not(X0))) ),
inference(resolution,[status(thm)],[f1567,f20]) ).
fof(f1604,plain,
! [X0,X1] :
( theorem(implies(X1,and(X1,X0)))
| ~ theorem(X0) ),
inference(resolution,[status(thm)],[f1581,f180]) ).
fof(f15466,plain,
! [X0,X1] :
( ~ theorem(X1)
| theorem(and(or(and(X0,X0),not(X0)),X1)) ),
inference(resolution,[status(thm)],[f1214,f1604]) ).
fof(f24627,plain,
! [X0] :
( ~ theorem(implies(not(X0),implies(X0,not(X0))))
| theorem(equivalent(implies(X0,not(X0)),not(X0))) ),
inference(paramodulation,[status(thm)],[f139,f15466]) ).
fof(f24669,plain,
! [X0] : theorem(equivalent(implies(X0,not(X0)),not(X0))),
inference(forward_subsumption_resolution,[status(thm)],[f24627,f33]) ).
fof(f24742,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f23,f24669]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL311-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.49 % Computer : n026.cluster.edu
% 0.17/0.49 % Model : x86_64 x86_64
% 0.17/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.49 % Memory : 8046.5625MB
% 0.17/0.49 % OS : Linux 6.8.0-71-generic
% 0.17/0.49 % CPULimit : 300
% 0.17/0.49 % WCLimit : 300
% 0.17/0.49 % DateTime : Mon Sep 21 00:22:51 UTC 2026
% 0.17/0.50 % CPUTime :
% 0.17/0.53 % Drodi V4.1.1
% 26.17/3.92 % Refutation found
% 26.17/3.92 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 26.17/3.92 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 1.45/4.12 % Elapsed time: 3.597472 seconds
% 1.45/4.12 % CPU time: 27.644085 seconds
% 1.45/4.12 % Total memory used: 433.010 MB
% 1.45/4.12 % Net memory used: 418.676 MB
%------------------------------------------------------------------------------