%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN295-1 : TPTP v9.3.1. Released v1.1.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:17 PM UTC 2026
% Result : Unsatisfiable 4.15s 1.04s
% Output : Proof 4.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 14 unt; 0 def)
% Number of atoms : 22 ( 6 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 10 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-4 aty)
% Number of variables : 5 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f143,axiom,
( ~ s0(B)
| q1(B,B,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_106) ).
fof(f143_nnf,plain,
! [B] :
( ~ s0(B)
| q1(B,B,B) ),
inference(nnf_transformation,[status(thm)],[f143]) ).
fof(f143_sk,plain,
! [B] :
( ~ s0(B)
| q1(B,B,B) ),
inference(skolemisation,[status(esa)],[f143_nnf]) ).
cnf(c143,plain,
( ~ s0(X0)
| q1(X0,X0,X0) ),
inference(cnf_transformation,[status(esa)],[f143_sk]) ).
cnf(hi141,axiom,
ifeq(s0(X0),true,q1(X0,X0,X0),true) = true,
inference(equality_encoding,[status(esa)],[c143]) ).
cnf(f0,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f0_nnf,plain,
s0(d),
inference(nnf_transformation,[status(thm)],[f0]) ).
cnf(c0,plain,
s0(d),
inference(cnf_transformation,[status(esa)],[f0_nnf]) ).
cnf(hi0,axiom,
s0(d) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t5,plain,
q1(d,d,d) = true,
inference(hyper_resolution,[status(thm)],[hi141,hi0]) ).
cnf(t51,plain,
q1(d,d,d) = true,
inference(orient,[status(thm)],[t5]) ).
cnf(f368,negated_conjecture,
~ q1(d,d,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ q1(d,d,d),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ q1(d,d,d),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ q1(d,d,d),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
q1(d,d,d) != true,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t51]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN295-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n026.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 00:48:41 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.15/1.04 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.15/1.04 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------