%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYO611-1 : TPTP v9.3.1. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n020.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:48:32 PM UTC 2026
% Result : Unsatisfiable 0.16s 6.04s
% Output : Proof 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 16 unt; 0 def)
% Number of atoms : 28 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 14 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-4 aty)
% Number of variables : 20 ( 3 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f4,axiom,
( ~ le(s(A0),A1)
| ~ eq(f(A1),a0)
| ~ eq(f(A0),a0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).
fof(f4_nnf,plain,
! [A0,A1] :
( ~ le(s(A0),A1)
| ~ eq(f(A1),a0)
| ~ eq(f(A0),a0) ),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [A0,A1] :
( ~ le(s(A0),A1)
| ~ eq(f(A1),a0)
| ~ eq(f(A0),a0) ),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
( ~ le(s(X0),X1)
| ~ eq(f(X1),a0)
| ~ eq(f(X0),a0) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(hi4,axiom,
ifeq(eq(f(X0),a0),true,ifeq(eq(f(X1),a0),true,ifeq(le(s(X0),X1),true,false,true),true),true) = true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(f3,axiom,
eq(f(A),a0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
fof(f3_nnf,plain,
! [A] : eq(f(A),a0),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [A] : eq(f(A),a0),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
eq(f(X0),a0),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi3,axiom,
eq(f(X0),a0) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(f0,axiom,
le(A,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
fof(f0_nnf,plain,
! [A] : le(A,A),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [A] : le(A,A),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
le(X0,X0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,axiom,
le(X0,X0) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi4,hi3,hi3,hi0]) ).
cnf(t31,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t31]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO611-1 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/5.39 % Computer : n020.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 : Fri Sep 25 03:16:09 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.16/6.04 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/6.04 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------