%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN399+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 : n016.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:39:58 PM UTC 2026
% Result : Theorem 0.50s 1.28s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 1 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 75 ( 27 ~; 27 |; 13 &)
% ( 5 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 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 : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 23 ( 0 sgn 20 !; 3 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] :
( f(X0)
<=> p )
=> ( ! [X1] : f(X1)
<=> p ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish223) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( f(X0)
<=> p )
=> ( ! [X1] : f(X1)
<=> p ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ! [X0] :
( f(X0)
<=> p )
& ( ! [X1] : f(X1)
<~> p ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ! [X0] :
( ( ~ f(X0)
| p )
& ( ~ p
| f(X0) ) )
& ( ! [X1] : f(X1)
| p )
& ( ? [X1] : ~ f(X1)
| ~ p ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X0] :
( ( ~ f(X0)
| p )
& ( ~ p
| f(X0) ) )
& ( ! [X1] : f(X1)
| p )
& ( ? [X1] : ~ f(X1)
| ~ p ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ! [X2] :
( ( ~ f(X2)
| p )
& ( ~ p
| f(X2) ) )
& ( ! [X1] : f(X1)
| p )
& ( ? [X0] : ~ f(X0)
| ~ p ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ! [X2] :
( ( ~ f(X2)
| p )
& ( ~ p
| f(X2) ) )
& ( ! [X1] : f(X1)
| p )
& ( ~ f(sK0)
| ~ p ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f6]) ).
fof(f8,plain,
! [X2] :
( ~ f(X2)
| p ),
inference(cnf_transformation,[],[f7]) ).
fof(f9,plain,
! [X2] :
( ~ p
| f(X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
! [X1] :
( f(X1)
| p ),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
( ~ f(sK0)
| ~ p ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_49,negated_conjecture,
( ~ p
| ~ f(sK0) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] :
( p
| f(X0) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( f(X0)
| ~ p ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_52,negated_conjecture,
! [X0: $i] :
( p
| ~ f(X0) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_53,plain,
( p
| f(sK0) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_54,plain,
( p
| ~ f(sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_55,plain,
( f(sK0)
| ~ p ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_56,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_49,c_55,c_54,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN399+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.10/0.37 % Computer : n016.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 01:09:45 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 0.50/1.28 % SZS status Started for theBenchmark.p
% 0.50/1.28 % SZS status Theorem for theBenchmark.p
% 0.50/1.28
% 0.50/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.50/1.28
% 0.50/1.28 % ------ iProver source info
% 0.50/1.28
% 0.50/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 0.50/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.50/1.28 % git: non_committed_changes: false
% 0.50/1.28
% 0.50/1.28 % ------ Parsing...
% 0.50/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 0.50/1.28 %
% 0.50/1.28
% 0.50/1.28 % ------ Preprocessing...%
% 0.50/1.28
% 0.50/1.28 % SZS status Theorem for theBenchmark.p
% 0.50/1.28
% 0.50/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.50/1.28
% 0.50/1.28
%------------------------------------------------------------------------------