%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL171-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 : n015.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:08 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.88s
% Output : Proof 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 27 unt; 0 def)
% Number of atoms : 35 ( 18 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 ( 2 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 : 43 ( 0 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(hi6,axiom,
ifeq(axiom(X0),true,theorem(X0),true) = true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(f2,axiom,
axiom(implies(or(A,B),or(B,A))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f2_nnf,plain,
! [A,B] : axiom(implies(or(A,B),or(B,A))),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [A,B] : axiom(implies(or(A,B),or(B,A))),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
axiom(implies(or(X0,X1),or(X1,X0))),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi3,axiom,
axiom(implies(or(X0,X1),or(X1,X0))) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
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(hi1,axiom,
implies(X0,X1) = or(not(X0),X1),
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t8,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi3,hi1]) ).
cnf(t3,plain,
or(not(X1),X2) = implies(X1,X2),
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t13,plain,
or(not(X1),X2) = implies(X1,X2),
inference(orient,[status(thm)],[t3]) ).
cnf(t143,plain,
theorem(implies(or(X1,X2),or(X2,X1))) = true,
inference(step,[status(thm)],[t8,t13]) ).
cnf(t16,plain,
theorem(implies(or(X1,X2),or(X2,X1))) = true,
inference(orient,[status(thm)],[t143]) ).
cnf(t17,plain,
true = theorem(implies(implies(X1,X2),or(X2,not(X1)))),
inference(cp,[status(thm)],[t16,t13]) ).
cnf(t61,plain,
theorem(implies(implies(X1,X2),or(X2,not(X1)))) = true,
inference(orient,[status(thm)],[t17]) ).
cnf(t62,plain,
true = theorem(implies(implies(X1,not(X2)),implies(X2,not(X1)))),
inference(cp,[status(thm)],[t61,t13]) ).
cnf(t136,plain,
theorem(implies(implies(X1,not(X2)),implies(X2,not(X1)))) = true,
inference(orient,[status(thm)],[t62]) ).
cnf(f8,negated_conjecture,
~ theorem(implies(implies(p,not(q)),implies(q,not(p)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f8_nnf,plain,
~ theorem(implies(implies(p,not(q)),implies(q,not(p)))),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
~ theorem(implies(implies(p,not(q)),implies(q,not(p)))),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
~ theorem(implies(implies(p,not(q)),implies(q,not(p)))),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(goal_0,negated_conjecture,
theorem(implies(implies(p,not(q)),implies(q,not(p)))) != true,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t136]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL171-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/5.39 % Computer : n015.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Wed Sep 23 22:12:46 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.15/5.88 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/5.88 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------