%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL193-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 : n014.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:04 PM UTC 2026
% Result : Unsatisfiable 2.96s 0.86s
% Output : CNFRefutation 2.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 15 unt; 0 def)
% Number of atoms : 37 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 20 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [A,B] : axiom(implies(or(A,B),or(B,A))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
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,negated_conjecture,
~ theorem(implies(implies(q,r),implies(or(p,q),or(r,p)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,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(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f15,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f16,plain,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f17,plain,
! [Y] :
( ~ theorem(Y)
| ! [X] :
( ~ theorem(implies(Y,X))
| theorem(X) ) ),
inference(miniscoping,[status(thm)],[f8]) ).
fof(f18,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(implies(X1,X0))
| theorem(X0) ),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f19,plain,
~ theorem(implies(implies(q,r),implies(or(p,q),or(r,p)))),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f24,plain,
! [X0,X1] : theorem(implies(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[f12,f16]) ).
fof(f30,plain,
! [X0] :
( ~ theorem(X0)
| ~ theorem(implies(X0,implies(implies(q,r),implies(or(p,q),or(r,p))))) ),
inference(resolution,[status(thm)],[f18,f19]) ).
fof(f42,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(implies(X1,implies(X0,implies(implies(q,r),implies(or(p,q),or(r,p))))))
| ~ theorem(X0) ),
inference(resolution,[status(thm)],[f30,f18]) ).
fof(f47,plain,
! [X0,X1,X2] : theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(resolution,[status(thm)],[f14,f16]) ).
fof(f80,plain,
! [X0,X1,X2] : theorem(implies(implies(X0,X1),implies(implies(X2,X0),or(not(X2),X1)))),
inference(paramodulation,[status(thm)],[f15,f47]) ).
fof(f82,plain,
! [X0,X1,X2] : theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
inference(forward_demodulation,[status(thm)],[f15,f80]) ).
fof(f94,plain,
! [X0] :
( ~ theorem(implies(X0,implies(or(p,q),or(r,p))))
| ~ theorem(implies(implies(q,r),X0)) ),
inference(resolution,[status(thm)],[f42,f82]) ).
fof(f180,plain,
! [X0] : ~ theorem(implies(implies(or(X0,q),or(X0,r)),implies(or(p,q),or(r,p)))),
inference(resolution,[status(thm)],[f47,f94]) ).
fof(f456,plain,
! [X0,X1,X2] :
( ~ theorem(implies(X1,X2))
| theorem(implies(implies(X0,X1),implies(X0,X2))) ),
inference(resolution,[status(thm)],[f82,f18]) ).
fof(f1009,plain,
~ theorem(implies(or(p,r),or(r,p))),
inference(resolution,[status(thm)],[f456,f180]) ).
fof(f1019,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f1009,f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL193-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.36 % Computer : n014.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:10:05 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 % Drodi V4.1.1
% 2.96/0.86 % Refutation found
% 2.96/0.86 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 2.96/0.86 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 2.96/0.88 % Elapsed time: 0.497648 seconds
% 2.96/0.88 % CPU time: 3.589535 seconds
% 2.96/0.88 % Total memory used: 108.316 MB
% 2.96/0.88 % Net memory used: 103.255 MB
%------------------------------------------------------------------------------