%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN346+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n026.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 03:34:26 PM UTC 2026
% Result : Theorem 3.23s 0.84s
% Output : Proof 3.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 8 unt; 0 def)
% Number of atoms : 36 ( 6 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 37 ( 15 ~; 8 |; 10 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-4 aty)
% Number of variables : 30 ( 7 sgn 12 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
! [X1,X2] :
? [Y1,Y2] :
! [Z1,Z2] :
( big_f(X2,Z1)
=> ( big_f(Y1,Z2)
=> ( ( big_f(Y2,Z2)
& big_f(X2,Z2) )
| ( big_f(Y2,Z1)
& big_f(Y1,Z1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_17_2) ).
fof(f0_neg,negated_conjecture,
~ ! [X1,X2] :
? [Y1,Y2] :
! [Z1,Z2] :
( big_f(X2,Z1)
=> ( big_f(Y1,Z2)
=> ( ( big_f(Y2,Z2)
& big_f(X2,Z2) )
| ( big_f(Y2,Z1)
& big_f(Y1,Z1) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
? [X1,X2] :
! [Y1,Y2] :
? [Z1,Z2] :
( ( ~ big_f(Y2,Z2)
| ~ big_f(X2,Z2) )
& ( ~ big_f(Y2,Z1)
| ~ big_f(Y1,Z1) )
& big_f(Y1,Z2)
& big_f(X2,Z1) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [Y1,Y2] :
( ( ~ big_f(Y2,sk3(Y1,Y2))
| ~ big_f(sk1,sk3(Y1,Y2)) )
& ( ~ big_f(Y2,sk2(Y1,Y2))
| ~ big_f(Y1,sk2(Y1,Y2)) )
& big_f(Y1,sk3(Y1,Y2))
& big_f(sk1,sk2(Y1,Y2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1,sk2,sk3])],[f0_nnf]) ).
cnf(c2,plain,
( ~ big_f(X3,sk2(X2,X3))
| ~ big_f(X2,sk2(X2,X3)) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi2,negated_conjecture,
ifeq(big_f(X0,sk2(X0,X1)),true,ifeq(big_f(X1,sk2(X0,X1)),true,false,true),true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(c0,plain,
big_f(sk1,sk2(X2,X3)),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,negated_conjecture,
big_f(sk1,sk2(X0,X1)) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi2,hi0,hi0]) ).
cnf(t15,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
cnf(c3,plain,
( ~ big_f(X3,sk3(X2,X3))
| ~ big_f(sk1,sk3(X2,X3)) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c2,c3]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t15]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN346+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.37 % Computer : n026.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 25 00:58:09 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.23/0.84 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.23/0.84 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------