%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL239-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 : n019.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 0.10s 0.45s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 32 unt; 0 def)
% Number of atoms : 57 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 16 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 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/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,negated_conjecture,
~ theorem(not(and(p,not(p)))),
file('/export/starexec/sandbox2/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(f16,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f17,plain,
! [X0] :
( ~ axiom(X0)
| theorem(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(not(and(p,not(p)))),
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(f226,plain,
! [X0] : theorem(implies(or(X0,X0),X0)),
inference(resolution,[status(thm)],[f11,f17]) ).
fof(f231,plain,
! [X0,X1] : theorem(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[f12,f17]) ).
fof(f238,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[f226,f19]) ).
fof(f243,plain,
! [X0,X1] :
( ~ theorem(X1)
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f231,f19]) ).
fof(f309,plain,
! [X0,X1] : theorem(implies(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[f13,f17]) ).
fof(f366,plain,
! [X0,X1,X2] : theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[f14,f17]) ).
fof(f400,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f309,f19]) ).
fof(f469,plain,
! [X0,X1] :
( ~ theorem(implies(X1,X0))
| theorem(or(X0,not(X1))) ),
inference(paramodulation,[status(thm)],[f16,f400]) ).
fof(f641,plain,
! [X0,X1,X2] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[f366,f19]) ).
fof(f768,plain,
! [X0,X1] : theorem(or(or(X0,X1),not(X1))),
inference(resolution,[status(thm)],[f469,f231]) ).
fof(f823,plain,
! [X0,X1,X2] : theorem(or(X0,or(or(X1,X2),not(X2)))),
inference(resolution,[status(thm)],[f768,f243]) ).
fof(f2144,plain,
! [X0,X1,X2] : theorem(or(or(X0,X1),or(X2,not(X1)))),
inference(resolution,[status(thm)],[f641,f823]) ).
fof(f2165,plain,
! [X0,X1,X2] : theorem(or(or(X0,not(X1)),or(X2,X1))),
inference(resolution,[status(thm)],[f2144,f400]) ).
fof(f2453,plain,
! [X0,X1,X2] : theorem(or(X0,or(or(X1,not(X2)),X2))),
inference(resolution,[status(thm)],[f2165,f641]) ).
fof(f2722,plain,
! [X0,X1] : theorem(or(or(X0,not(X1)),X1)),
inference(resolution,[status(thm)],[f2453,f238]) ).
fof(f2739,plain,
! [X0,X1] : theorem(or(X0,or(X1,not(X0)))),
inference(resolution,[status(thm)],[f2722,f400]) ).
fof(f2754,plain,
! [X0,X1] : theorem(or(X0,or(X1,not(X1)))),
inference(resolution,[status(thm)],[f2739,f641]) ).
fof(f2791,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[status(thm)],[f2754,f238]) ).
fof(f2816,plain,
! [X0] : theorem(implies(X0,not(not(X0)))),
inference(paramodulation,[status(thm)],[f16,f2791]) ).
fof(f2880,plain,
! [X0] :
( ~ theorem(X0)
| theorem(not(not(X0))) ),
inference(resolution,[status(thm)],[f2816,f19]) ).
fof(f2989,plain,
! [X0] : theorem(not(not(implies(X0,not(not(X0)))))),
inference(resolution,[status(thm)],[f2880,f2816]) ).
fof(f3019,plain,
! [X0] : theorem(not(and(X0,not(X0)))),
inference(forward_demodulation,[status(thm)],[f22,f2989]) ).
fof(f3022,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f21,f3019]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL239-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 00:14:20 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 % Drodi V4.1.1
% 0.10/0.45 % Refutation found
% 0.10/0.45 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.45 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.47 % Elapsed time: 0.105694 seconds
% 0.10/0.47 % CPU time: 0.582723 seconds
% 0.10/0.47 % Total memory used: 83.026 MB
% 0.10/0.47 % Net memory used: 82.267 MB
%------------------------------------------------------------------------------