%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN040-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n017.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:33:33 PM UTC 2026
% Result : Unsatisfiable 6.02s 6.23s
% Output : Proof 6.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 18 unt; 0 def)
% Number of atoms : 26 ( 10 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 10 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-4 aty)
% Number of variables : 6 ( 2 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f0,negated_conjecture,
( q
| ~ p ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
fof(f0_nnf,plain,
( q
| ~ p ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
( q
| ~ p ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( q
| ~ p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t2,plain,
ifeq(p,true,q,true) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(f3,negated_conjecture,
p,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
fof(f3_nnf,plain,
p,
inference(nnf_transformation,[status(thm)],[f3]) ).
cnf(c3,plain,
p,
inference(cnf_transformation,[status(esa)],[f3_nnf]) ).
cnf(t0,plain,
true = p,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(t5,plain,
p = true,
inference(orient,[status(thm)],[t0]) ).
cnf(t7,plain,
ifeq(true,true,q,true) = true,
inference(step,[status(thm)],[t2,t5]) ).
cnf(t1,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t4,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t1]) ).
cnf(t8,plain,
q = true,
inference(step,[status(thm)],[t7,t4]) ).
cnf(t6,plain,
q = true,
inference(orient,[status(thm)],[t8]) ).
cnf(f2,negated_conjecture,
~ q,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
fof(f2_nnf,plain,
~ q,
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
~ q,
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
~ q,
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(goal_0,negated_conjecture,
true != q,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t6]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN040-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/5.38 % Computer : n017.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Thu Sep 24 23:50:51 UTC 2026
% 0.12/5.38 % CPUTime :
% 0.12/5.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.02/6.23 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.02/6.23 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------