%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL680+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 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 : Fri Sep 25 02:02:38 PM UTC 2026
% Result : Theorem 6.03s 1.34s
% Output : Proof 6.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 7 unt; 0 def)
% Number of atoms : 15 ( 4 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 12 ~; 2 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 3 ( 0 sgn 0 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
~ ? [X] :
~ ( p1(X)
| ~ p1(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(f0_neg,negated_conjecture,
~ ~ ? [X] :
~ ( p1(X)
| ~ p1(X) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
? [X] :
( ~ p1(X)
& p1(X) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
( ~ p1(sk0)
& p1(sk0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c0,plain,
p1(sk0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t0,plain,
p1(sk0) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t1,plain,
p1(sk0) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(c1,plain,
~ p1(sk0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(goal_0,negated_conjecture,
p1(sk0) != true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t1]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL680+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.16/0.43 % Computer : n009.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Thu Sep 24 00:16:44 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.03/1.34 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.03/1.34 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------