%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL170-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n018.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 : Fri Sep 25 02:01:07 PM UTC 2026
% Result : Unsatisfiable 3.35s 0.91s
% Output : Proof 3.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 28 unt; 0 def)
% Number of atoms : 36 ( 19 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 10 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 46 ( 11 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f6,axiom,
( ~ axiom(X)
| theorem(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f6_nnf,plain,
! [X] :
( ~ axiom(X)
| theorem(X) ),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
! [X] :
( ~ axiom(X)
| theorem(X) ),
inference(skolemisation,[status(esa)],[f6_nnf]) ).
cnf(c6,plain,
( ~ axiom(X0)
| theorem(X0) ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(t4,plain,
ifeq(axiom(X1),true,theorem(X1),true) = true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(t19,plain,
ifeq(axiom(X1),true,theorem(X1),true) = true,
inference(orient,[status(thm)],[t4]) ).
cnf(f1,axiom,
axiom(implies(A,or(B,A))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f1_nnf,plain,
! [A,B] : axiom(implies(A,or(B,A))),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [A,B] : axiom(implies(A,or(B,A))),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
axiom(implies(X0,or(X1,X0))),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(t1,plain,
axiom(implies(X1,or(X2,X1))) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t12,plain,
axiom(implies(X1,or(X2,X1))) = true,
inference(orient,[status(thm)],[t1]) ).
cnf(t22,plain,
true = ifeq(true,true,theorem(implies(X1,or(X2,X1))),true),
inference(cp,[status(thm)],[t19,t12]) ).
cnf(t0,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t11,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t0]) ).
cnf(t63,plain,
true = theorem(implies(X1,or(X2,X1))),
inference(step,[status(thm)],[t22,t11]) ).
cnf(t45,plain,
theorem(implies(X1,or(X2,X1))) = true,
inference(orient,[status(thm)],[t63]) ).
cnf(f5,axiom,
implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
fof(f5_nnf,plain,
! [X,Y] : implies(X,Y) = or(not(X),Y),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
! [X,Y] : implies(X,Y) = or(not(X),Y),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c5,plain,
implies(X0,X1) = or(not(X0),X1),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(t3,plain,
or(not(X1),X2) = implies(X1,X2),
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t32,plain,
or(not(X1),X2) = implies(X1,X2),
inference(orient,[status(thm)],[t3]) ).
cnf(t46,plain,
true = theorem(implies(X1,implies(X2,X1))),
inference(cp,[status(thm)],[t45,t32]) ).
cnf(t57,plain,
theorem(implies(X1,implies(X2,X1))) = true,
inference(orient,[status(thm)],[t46]) ).
cnf(f8,negated_conjecture,
~ theorem(implies(q,implies(p,q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f8_nnf,plain,
~ theorem(implies(q,implies(p,q))),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
~ theorem(implies(q,implies(p,q))),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
~ theorem(implies(q,implies(p,q))),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(goal_0,negated_conjecture,
theorem(implies(q,implies(p,q))) != true,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t57]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL170-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n018.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Wed Sep 23 22:11:17 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.35/0.91 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.35/0.91 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------