%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN416+1 : TPTP v9.3.1. Released v2.0.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:34:39 PM UTC 2026
% Result : Theorem 3.29s 0.83s
% Output : Proof 3.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 10 unt; 0 def)
% Number of atoms : 26 ( 6 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 21 ( 9 ~; 2 |; 6 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ( q
=> p )
| ( p
=> q ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel16) ).
fof(f0_neg,negated_conjecture,
~ ( ( q
=> p )
| ( p
=> q ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ~ p
& q
& ~ q
& p ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
( ~ p
& q
& ~ q
& p ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c3,plain,
~ p,
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi3,negated_conjecture,
ifeq(p,true,false,true) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(c0,plain,
p,
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,negated_conjecture,
p = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi3,hi0]) ).
cnf(t7,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
cnf(c1,plain,
~ q,
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c1,c3]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t7]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN416+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n020.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 01:07:19 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.29/0.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.29/0.83 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------