%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL231-1 : TPTP v9.3.1. Released v1.1.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:14 PM UTC 2026
% Result : Unsatisfiable 3.82s 0.99s
% Output : CNFRefutation 3.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 15 unt; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 50 ( 27 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 68 ( 68 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [A,B] : axiom(or(not(A),or(B,A))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X] :
( ~ axiom(X)
| theorem(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y] :
( ~ theorem(Y)
| ~ axiom(or(not(Y),X))
| theorem(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,Z,Y] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
~ theorem(or(not(or(not(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f12,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f13,plain,
! [X0,X1,X2] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f14,plain,
! [X0,X1,X2] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f15,plain,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f16,plain,
! [Y] :
( ~ theorem(Y)
| ! [X] :
( ~ axiom(or(not(Y),X))
| theorem(X) ) ),
inference(miniscoping,[status(thm)],[f7]) ).
fof(f17,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ axiom(or(not(X1),X0))
| theorem(X0) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f18,plain,
! [Z,Y] :
( ~ theorem(or(not(Y),Z))
| ! [X] :
( ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ) ),
inference(miniscoping,[status(thm)],[f8]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ~ theorem(or(not(X2),X1))
| ~ axiom(or(not(X0),X2))
| theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f20,plain,
~ theorem(or(not(or(not(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r)))),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f40,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[f12,f15]) ).
fof(f43,plain,
! [X0,X1,X2] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[f13,f17]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ~ theorem(or(not(X1),X2))
| theorem(or(not(or(X0,X1)),or(X0,X2))) ),
inference(resolution,[status(thm)],[f14,f17]) ).
fof(f65,plain,
! [X0,X1,X2,X3] :
( ~ axiom(or(not(X3),X1))
| theorem(or(not(X3),or(X0,X2)))
| ~ theorem(or(X0,or(not(X1),X2))) ),
inference(resolution,[status(thm)],[f43,f19]) ).
fof(f81,plain,
! [X0,X1,X2,X3] :
( ~ axiom(or(not(X2),or(X3,X0)))
| theorem(or(not(X2),or(X3,X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[f45,f19]) ).
fof(f142,plain,
! [X0,X1,X2,X3] :
( theorem(or(not(or(X2,X1)),or(X0,X3)))
| ~ theorem(or(X0,or(not(or(X1,X2)),X3))) ),
inference(resolution,[status(thm)],[f65,f12]) ).
fof(f144,plain,
! [X0,X1,X2,X3] :
( theorem(or(not(X2),or(X0,X3)))
| ~ theorem(or(X0,or(not(or(X1,X2)),X3))) ),
inference(resolution,[status(thm)],[f65,f11]) ).
fof(f157,plain,
! [X0,X1,X2,X3] :
( theorem(or(not(or(X0,or(X3,X1))),or(X3,X2)))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[f81,f13]) ).
fof(f625,plain,
! [X0,X1,X2] : theorem(or(not(X0),or(not(or(X1,not(or(X2,X0)))),X1))),
inference(resolution,[status(thm)],[f144,f40]) ).
fof(f882,plain,
~ theorem(or(not(or(not(or(not(p),q)),r)),or(not(q),r))),
inference(resolution,[status(thm)],[f157,f20]) ).
fof(f1106,plain,
~ theorem(or(not(q),or(not(or(r,not(or(not(p),q)))),r))),
inference(resolution,[status(thm)],[f882,f142]) ).
fof(f1113,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f1106,f625]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL231-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n019.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 00:13:36 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.38 % Drodi V4.1.1
% 3.82/0.99 % Refutation found
% 3.82/0.99 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 3.82/0.99 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 3.20/1.03 % Elapsed time: 0.643601 seconds
% 3.20/1.03 % CPU time: 4.739897 seconds
% 3.20/1.03 % Total memory used: 131.888 MB
% 3.20/1.03 % Net memory used: 127.006 MB
%------------------------------------------------------------------------------