%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL646+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 : 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:02:26 PM UTC 2026
% Result : Theorem 3.65s 0.91s
% Output : Proof 3.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 14 unt; 0 def)
% Number of atoms : 80 ( 8 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 113 ( 52 ~; 39 |; 22 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-4 aty)
% Number of variables : 30 ( 0 sgn 21 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
~ ? [X] :
~ ( ! [Y] :
( p1(Y)
| ~ r1(X,Y) )
| ! [Y] :
( p2(Y)
| ~ r1(X,Y) )
| ! [Y] :
( p3(Y)
| ~ r1(X,Y) )
| ! [Y] :
( p5(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p2(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p4(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p2(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p6(Y)
| ~ r1(X,Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(f0_neg,negated_conjecture,
~ ~ ? [X] :
~ ( ! [Y] :
( p1(Y)
| ~ r1(X,Y) )
| ! [Y] :
( p2(Y)
| ~ r1(X,Y) )
| ! [Y] :
( p3(Y)
| ~ r1(X,Y) )
| ! [Y] :
( p5(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p2(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p4(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p2(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p6(Y)
| ~ r1(X,Y) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
? [X] :
( ? [Y] :
( ~ p1(Y)
& r1(X,Y) )
& ? [Y] :
( ~ p2(Y)
& r1(X,Y) )
& ? [Y] :
( ~ p3(Y)
& r1(X,Y) )
& ? [Y] :
( ~ p5(Y)
& r1(X,Y) )
& ! [Y] :
( p2(Y)
| ~ r1(X,Y) )
& ! [Y] :
( p4(Y)
| ~ r1(X,Y) )
& ! [Y] :
( p2(Y)
| ~ r1(X,Y) )
& ! [Y] :
( p6(Y)
| ~ r1(X,Y) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [Y] :
( ~ p1(sk4)
& r1(sk0,sk4)
& ~ p2(sk3)
& r1(sk0,sk3)
& ~ p3(sk2)
& r1(sk0,sk2)
& ~ p5(sk1)
& r1(sk0,sk1)
& ( p2(Y)
| ~ r1(sk0,Y) )
& ( p4(Y)
| ~ r1(sk0,Y) )
& ( p2(Y)
| ~ r1(sk0,Y) )
& ( p6(Y)
| ~ r1(sk0,Y) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1,sk2,sk3,sk4])],[f0_nnf]) ).
cnf(c3,plain,
( p2(X1)
| ~ r1(sk0,X1) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi3,negated_conjecture,
ifeq(r1(sk0,X0),true,p2(X0),true) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(c8,plain,
r1(sk0,sk3),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi6,negated_conjecture,
r1(sk0,sk3) = true,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(h6,plain,
p2(sk3) = true,
inference(hyper_resolution,[status(thm)],[hi3,hi6]) ).
cnf(c9,plain,
~ p2(sk3),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi10,negated_conjecture,
ifeq(p2(sk3),true,false,true) = true,
inference(equality_encoding,[status(esa)],[c9]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi10,h6]) ).
cnf(t55,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
cnf(c5,plain,
~ p5(sk1),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c7,plain,
~ p3(sk2),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c11,plain,
~ p1(sk4),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c5,c7,c9,c11]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t55]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL646+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.09/0.35 % Computer : n015.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Wed Sep 23 23:58:39 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.65/0.91 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.65/0.91 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------