%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN051-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 : n005.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:36 PM UTC 2026
% Result : Unsatisfiable 5.17s 1.32s
% Output : Proof 5.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 4 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 34 ( 17 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 8 ( 4 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f1,axiom,
( p
| ~ big_f(b) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
fof(f1_nnf,plain,
( p
| ~ big_f(b) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
( p
| ~ big_f(b) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( p
| ~ big_f(b) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(f2,negated_conjecture,
( big_f(X)
| p ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
fof(f2_nnf,plain,
! [X] :
( big_f(X)
| p ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X] :
( big_f(X)
| p ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( big_f(X0)
| p ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p4,plain,
( p
| p ),
inference(resolution,[status(thm)],[c1,c2]) ).
cnf(p5,plain,
p,
inference(factoring,[status(thm)],[p4]) ).
cnf(f0,axiom,
( big_f(a)
| ~ p ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
fof(f0_nnf,plain,
( big_f(a)
| ~ p ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
( big_f(a)
| ~ p ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( big_f(a)
| ~ p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p6,plain,
big_f(a),
inference(resolution,[status(thm)],[p5,c0]) ).
cnf(f3,negated_conjecture,
( ~ p
| ~ big_f(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
fof(f3_nnf,plain,
! [X] :
( ~ p
| ~ big_f(X) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [X] :
( ~ p
| ~ big_f(X) ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
( ~ p
| ~ big_f(X0) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(p7,plain,
~ p,
inference(resolution,[status(thm)],[p6,c3]) ).
cnf(p8,plain,
$false,
inference(resolution,[status(thm)],[p7,p5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN051-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n005.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 23:57:02 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.17/1.32 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.17/1.32 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------