%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN051+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n010.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:38:59 PM UTC 2026
% Result : Theorem 0.41s 11.30s
% Output : CNFRefutation 1.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 3 unt; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 39 ( 18 ~; 15 |; 1 &)
% ( 2 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 : 13 ( 0 sgn 7 !; 6 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
( p
=> big_f(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel21_1) ).
fof(f2,axiom,
? [X0] :
( big_f(X0)
=> p ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel21_2) ).
fof(f3,conjecture,
? [X0] :
( p
<=> big_f(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel21) ).
fof(f4,negated_conjecture,
~ ? [X0] :
( p
<=> big_f(X0) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,plain,
? [X0] :
( ~ p
| big_f(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f6,plain,
? [X0] :
( ~ big_f(X0)
| p ),
inference(ennf_transformation,[],[f2]) ).
fof(f7,plain,
! [X0] :
( p
<~> big_f(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f8,plain,
( ~ p
| big_f(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f5]) ).
fof(f9,plain,
( ~ big_f(sK1)
| p ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f6]) ).
fof(f10,plain,
! [X0] :
( ( p
| big_f(X0) )
& ( ~ p
| ~ big_f(X0) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f11,plain,
( ~ p
| big_f(sK0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f12,plain,
( ~ big_f(sK1)
| p ),
inference(cnf_transformation,[],[f9]) ).
fof(f13,plain,
! [X0] :
( p
| big_f(X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f14,plain,
! [X0] :
( ~ p
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_49,plain,
( big_f(sK0)
| ~ p ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_50,plain,
( p
| ~ big_f(sK1) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( ~ p
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_52,negated_conjecture,
! [X0: $i] :
( p
| big_f(X0) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_54,plain,
( ~ p
| ~ big_f(sK0) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_55,negated_conjecture,
! [X0: $i] : big_f(X0),
inference(global_subsumption_just,[status(thm)],[c_52,c_52,c_49,c_54]) ).
tcf(c_58,plain,
~ big_f(sK1),
inference(global_subsumption_just,[status(thm)],[c_50,c_50,c_51,c_55]) ).
tcf(c_66,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_58,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN051+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/10.38 % Computer : n010.cluster.edu
% 0.11/10.38 % Model : x86_64 x86_64
% 0.11/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.38 % Memory : 8046.5625MB
% 0.11/10.38 % OS : Linux 6.8.0-71-generic
% 0.11/10.39 % CPULimit : 300
% 0.11/10.39 % WCLimit : 300
% 0.11/10.39 % DateTime : Thu Sep 24 23:57:26 UTC 2026
% 0.11/10.39 % CPUTime :
% 0.11/10.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/10.43 Running first-order theorem proving
% 0.14/10.43 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/10.44
% 0.14/10.44 % ======== iProver multi-core TPTP/SMT =========
% 0.14/10.44
% 0.14/10.44 % Detected problem language: tptp
% 0.14/10.45 % Proving...
% 0.41/11.30 % SZS status Started for theBenchmark.p
% 0.41/11.30 % SZS status Theorem for theBenchmark.p
% 0.41/11.30
% 0.41/11.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.41/11.30
% 0.41/11.30 % ------ iProver source info
% 0.41/11.30
% 0.41/11.30 % git: date: 2026-07-19 20:42:38 +0200
% 0.41/11.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.41/11.30 % git: non_committed_changes: false
% 0.41/11.30
% 0.41/11.30 % ------ Parsing...
% 0.41/11.30 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 0.41/11.30 %
% 0.41/11.30
% 0.41/11.30 % ------ Preprocessing...%
% 0.41/11.30
% 0.41/11.30 % SZS status Theorem for theBenchmark.p
% 0.41/11.30
% 0.41/11.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.16/11.30
% 1.16/11.30
%------------------------------------------------------------------------------