%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN396+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n003.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:57 PM UTC 2026
% Result : Theorem 1.49s 1.27s
% Output : CNFRefutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 39 ( 21 ~; 12 |; 3 &)
% ( 2 <=>; 0 =>; 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 : 23 ( 0 sgn 15 !; 8 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ~ ! [X0] : f(X0)
<=> ? [X1] : ~ f(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish203) ).
fof(f2,negated_conjecture,
~ ( ~ ! [X0] : f(X0)
<=> ? [X1] : ~ f(X1) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ? [X0] : ~ f(X0)
<~> ? [X1] : ~ f(X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ( ? [X0] : ~ f(X0)
| ? [X1] : ~ f(X1) )
& ( ! [X0] : f(X0)
| ! [X1] : f(X1) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ? [X3] : ~ f(X3)
| ? [X2] : ~ f(X2) )
& ( ! [X1] : f(X1)
| ! [X0] : f(X0) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
( ( ~ f(sK1)
| ~ f(sK0) )
& ( ! [X1] : f(X1)
| ! [X0] : f(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0),skolemize(X3,sK1)],[f5]) ).
fof(f7,plain,
( ~ f(sK1)
| ~ f(sK0) ),
inference(cnf_transformation,[],[f6]) ).
fof(f8,plain,
! [X0,X1] :
( f(X1)
| f(X0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_49,negated_conjecture,
! [X0: $i,X1: $i] :
( f(X1)
| f(X0) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_50,negated_conjecture,
( ~ f(sK1)
| ~ f(sK0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_51,plain,
f(sK0),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_52,negated_conjecture,
~ f(sK1),
inference(global_subsumption_just,[status(thm)],[c_50,c_51,c_50]) ).
tcf(c_60,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_10
| f(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_49]) ).
tcf(c_61,negated_conjecture,
iPr_def_10,
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_49]) ).
tcf(c_62,negated_conjecture,
~ f(sK1),
inference(demodulation,[status(thm)],[c_52]) ).
tcf(c_63,negated_conjecture,
iPr_def_10,
inference(demodulation,[status(thm)],[c_61]) ).
tcf(c_65,negated_conjecture,
! [X0: $i] :
( f(X0)
| ~ iPr_def_10 ),
inference(demodulation,[status(thm)],[c_60]) ).
tcf(c_68,negated_conjecture,
! [X0: $i] : f(X0),
inference(global_subsumption_just,[status(thm)],[c_65,c_63,c_65]) ).
tcf(c_70,plain,
$false,
inference(resolution,[status(thm)],[c_68,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN396+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 01:06:21 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 1.49/1.27 % SZS status Started for theBenchmark.p
% 1.49/1.27 % SZS status Theorem for theBenchmark.p
% 1.49/1.27
% 1.49/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.49/1.27
% 1.49/1.27 % ------ iProver source info
% 1.49/1.27
% 1.49/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.49/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.49/1.27 % git: non_committed_changes: false
% 1.49/1.27
% 1.49/1.27 % ------ Parsing...
% 1.49/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.49/1.27 %
% 1.49/1.27
% 1.49/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.49/1.27
% 1.49/1.27 % ------ Preprocessing...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.49/1.27 gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.49/1.27 % ------ Proving...
% 1.49/1.27 % ------ Problem Properties
% 1.49/1.27
% 1.49/1.27 %
% 1.49/1.27 % clauses 3
% 1.49/1.27 % conjectures 3
% 1.49/1.27 % EPR 3
% 1.49/1.27 % Horn 3
% 1.49/1.27 % unary 2
% 1.49/1.27 % binary 1
% 1.49/1.27 % lits 4
% 1.49/1.27 % lits eq 0
% 1.49/1.27 % fd_pure 0
% 1.49/1.27 % fd_pseudo 0
% 1.49/1.27 % fd_cond 0
% 1.49/1.27 % fd_pseudo_cond 0
% 1.49/1.27 % AC symbols 0
% 1.49/1.27
% 1.49/1.27 % ------ Schedule EPR Horn non eq is on
% 1.49/1.27
% 1.49/1.27 % ------ no equalities: superposition off
% 1.49/1.27
% 1.49/1.27 % ------ Option_epr_horn Time Limit: Unbounded
% 1.49/1.27
% 1.49/1.27
% 1.49/1.27 % ------
% 1.49/1.27 % Current options:
% 1.49/1.27 % ------
% 1.49/1.27
% 1.49/1.27
% 1.49/1.27 %
% 1.49/1.27
% 1.49/1.27 % ------ Proving...
% 1.49/1.27 %
% 1.49/1.27
% 1.49/1.27 % SZS status Theorem for theBenchmark.p
% 1.49/1.27
% 1.49/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.49/1.27
% 1.49/1.27
%------------------------------------------------------------------------------