%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL253-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n009.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:19 PM UTC 2026
% Result : Unsatisfiable 198.62s 25.66s
% Output : CNFRefutation 198.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 17 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 58 ( 30 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 7 ( 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 : 86 ( 86 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [A,B] : axiom(or(not(A),or(B,A))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X] :
( ~ axiom(X)
| theorem(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y] :
( ~ theorem(Y)
| ~ axiom(or(not(Y),X))
| theorem(X) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
~ theorem(or(not(or(not(p),q)),or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[status(thm)],[f1]) ).
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(p),q)),or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))))),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f21,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[f10,f17]) ).
fof(f27,plain,
! [X0,X1] :
( ~ theorem(X1)
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f11,f17]) ).
fof(f34,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f12,f17]) ).
fof(f35,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[f12,f15]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[f13,f17]) ).
fof(f39,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(f47,plain,
! [X0,X1,X2] :
( ~ axiom(or(not(X0),or(X2,X1)))
| theorem(or(not(X0),or(X1,X2))) ),
inference(resolution,[status(thm)],[f35,f19]) ).
fof(f55,plain,
! [X0,X1,X2] :
( ~ theorem(or(X0,X2))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[f37,f27]) ).
fof(f67,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)],[f39,f19]) ).
fof(f88,plain,
! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[status(thm)],[f47,f11]) ).
fof(f100,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(or(or(X0,X1),X1)) ),
inference(resolution,[status(thm)],[f55,f21]) ).
fof(f110,plain,
! [X0,X1] : theorem(or(X0,or(not(X0),X1))),
inference(resolution,[status(thm)],[f88,f37]) ).
fof(f116,plain,
! [X0,X1,X2,X3] :
( theorem(or(not(or(not(X3),X1)),or(not(or(X0,X3)),X2)))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[f67,f14]) ).
fof(f228,plain,
! [X0,X1,X2] :
( ~ theorem(or(or(X0,or(X1,X2)),X2))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[f100,f55]) ).
fof(f274,plain,
! [X0,X1,X2,X3] :
( theorem(or(or(not(or(X0,X3)),X2),not(or(not(X3),X1))))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[f116,f34]) ).
fof(f672,plain,
! [X0,X1,X2,X3] :
( theorem(or(not(or(X0,X3)),or(X2,not(or(not(X3),X1)))))
| ~ theorem(or(not(or(X0,X1)),or(X2,not(or(not(X3),X1))))) ),
inference(resolution,[status(thm)],[f274,f228]) ).
fof(f2877,plain,
! [X0,X1,X2] : theorem(or(not(or(X0,X1)),or(not(not(or(X0,X2))),not(or(not(X1),X2))))),
inference(resolution,[status(thm)],[f672,f110]) ).
fof(f2890,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f20,f2877]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL253-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.07 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 % Computer : n009.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 00:15:57 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.49 % Drodi V4.1.1
% 198.62/25.66 % Refutation found
% 198.62/25.66 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 198.62/25.66 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 119.20/25.92 % Elapsed time: 25.425868 seconds
% 119.20/25.92 % CPU time: 199.991888 seconds
% 119.20/25.92 % Total memory used: 822.060 MB
% 119.20/25.92 % Net memory used: 774.701 MB
%------------------------------------------------------------------------------