%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL648+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n004.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:26 PM UTC 2026
% Result : Theorem 3.98s 0.95s
% Output : Proof 3.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 12 unt; 0 def)
% Number of atoms : 39 ( 8 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 48 ( 26 ~; 12 |; 10 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 12 ( 0 sgn 6 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
~ ? [X] :
~ ( ! [Y] :
( ~ ( p101(Y)
& p201(Y) )
| ~ r1(X,Y) )
| ~ ! [Y] :
( ~ ( p101(Y)
& p201(Y) )
| ~ r1(X,Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(f0_neg,negated_conjecture,
~ ~ ? [X] :
~ ( ! [Y] :
( ~ ( p101(Y)
& p201(Y) )
| ~ r1(X,Y) )
| ~ ! [Y] :
( ~ ( p101(Y)
& p201(Y) )
| ~ r1(X,Y) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
? [X] :
( ? [Y] :
( p101(Y)
& p201(Y)
& r1(X,Y) )
& ! [Y] :
( ~ p101(Y)
| ~ p201(Y)
| ~ r1(X,Y) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [Y] :
( p101(sk1)
& p201(sk1)
& r1(sk0,sk1)
& ( ~ p101(Y)
| ~ p201(Y)
| ~ r1(sk0,Y) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).
cnf(c0,plain,
( ~ p101(X1)
| ~ p201(X1)
| ~ r1(sk0,X1) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi3,negated_conjecture,
ifeq(r1(sk0,X0),true,ifeq(p201(X0),true,ifeq(p101(X0),true,false,true),true),true) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(c1,plain,
r1(sk0,sk1),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,negated_conjecture,
r1(sk0,sk1) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(c2,plain,
p201(sk1),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi1,negated_conjecture,
p201(sk1) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(c3,plain,
p101(sk1),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi2,negated_conjecture,
p101(sk1) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi3,hi0,hi1,hi2]) ).
cnf(t8,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t8]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL648+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n004.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 23:57:51 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.98/0.95 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.98/0.95 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------