%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN318+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 : n011.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:41 PM UTC 2026
% Result : Theorem 1.79s 1.30s
% Output : CNFRefutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 72 ( 29 ~; 16 |; 8 &)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 36 ( 0 sgn 29 !; 7 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0] :
( ! [X1] :
( big_f(X1)
=> ( big_f(X0)
=> big_g(X1) ) )
=> ( p
=> ! [X1] :
( big_f(X1)
=> big_g(X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_2_4) ).
fof(f2,negated_conjecture,
~ ? [X0] :
( ! [X1] :
( big_f(X1)
=> ( big_f(X0)
=> big_g(X1) ) )
=> ( p
=> ! [X1] :
( big_f(X1)
=> big_g(X0) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ? [X0] :
( ! [X1] :
( big_f(X1)
=> ( big_f(X0)
=> big_g(X1) ) )
=> ( p
=> ! [X2] :
( big_f(X2)
=> big_g(X0) ) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
~ ? [X0] :
( ! [X1] :
( big_f(X1)
=> ( big_f(X0)
=> big_g(X1) ) )
=> ! [X2] :
( big_f(X2)
=> big_g(X0) ) ),
inference(pure_predicate_removal,[],[f3]) ).
fof(f5,plain,
! [X0] :
( ! [X1] :
( ~ big_f(X1)
| ~ big_f(X0)
| big_g(X1) )
& ? [X2] :
( big_f(X2)
& ~ big_g(X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f6,plain,
! [X0] :
( ! [X1] :
( ~ big_f(X1)
| ~ big_f(X0)
| big_g(X1) )
& ? [X2] :
( big_f(X2)
& ~ big_g(X0) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
! [X0] :
( ! [X2] :
( ~ big_f(X2)
| ~ big_f(X0)
| big_g(X2) )
& ? [X1] :
( big_f(X1)
& ~ big_g(X0) ) ),
inference(rectify,[],[f6]) ).
fof(f8,plain,
! [X0] :
( ! [X2] :
( ~ big_f(X2)
| ~ big_f(X0)
| big_g(X2) )
& big_f(sK0(X0))
& ~ big_g(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f7]) ).
fof(f9,plain,
! [X2,X0] :
( ~ big_f(X2)
| ~ big_f(X0)
| big_g(X2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f10,plain,
! [X0] : big_f(sK0(X0)),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
! [X0] : ~ big_g(X0),
inference(cnf_transformation,[],[f8]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] : ~ big_g(X0),
inference(cnf_transformation,[],[f11]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] : big_f(sK0(X0)),
inference(cnf_transformation,[],[f10]) ).
tcf(c_51,negated_conjecture,
! [X0: $i,X1: $i] :
( big_g(X1)
| ~ big_f(X1)
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( ~ big_f(X1)
| ~ big_f(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_49]) ).
tcf(c_71,plain,
! [X0: $i] :
( ~ iPr_def_10
| ~ big_f(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_57]) ).
tcf(c_72,plain,
iPr_def_10,
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_57]) ).
tcf(c_73,plain,
iPr_def_10,
inference(demodulation,[status(thm)],[c_72]) ).
tcf(c_75,plain,
! [X0: $i] :
( ~ iPr_def_10
| ~ big_f(X0) ),
inference(demodulation,[status(thm)],[c_71]) ).
tcf(c_77,plain,
! [X0: $i] :
( ~ iPr_def_10
| ~ big_f(sK0(X0)) ),
inference(instantiation,[status(thm)],[c_75]) ).
tcf(c_78,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_77,c_73,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN318+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.12/0.38 % Computer : n011.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Fri Sep 25 00:48:58 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.44
% 0.12/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.44
% 0.12/0.44 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 1.79/1.30 % SZS status Started for theBenchmark.p
% 1.79/1.30 % SZS status Theorem for theBenchmark.p
% 1.79/1.30
% 1.79/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.79/1.30
% 1.79/1.30 % ------ iProver source info
% 1.79/1.30
% 1.79/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 1.79/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.79/1.30 % git: non_committed_changes: false
% 1.79/1.30
% 1.79/1.30 % ------ Parsing...
% 1.79/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.79/1.30
% 1.79/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.79/1.30
% 1.79/1.30 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.79/1.30 % ------ Proving...
% 1.79/1.30 % ------ Problem Properties
% 1.79/1.30
% 1.79/1.30 %
% 1.79/1.30 % clauses 3
% 1.79/1.30 % conjectures 1
% 1.79/1.30 % EPR 2
% 1.79/1.30 % Horn 3
% 1.79/1.30 % unary 2
% 1.79/1.30 % binary 1
% 1.79/1.30 % lits 4
% 1.79/1.30 % lits eq 0
% 1.79/1.30 % fd_pure 0
% 1.79/1.30 % fd_pseudo 0
% 1.79/1.30 % fd_cond 0
% 1.79/1.30 % fd_pseudo_cond 0
% 1.79/1.30 % AC symbols 0
% 1.79/1.30
% 1.79/1.30 % ------ Schedule dynamic 5 is on
% 1.79/1.30
% 1.79/1.30 % ------ no equalities: superposition off
% 1.79/1.30
% 1.79/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.79/1.30
% 1.79/1.30
% 1.79/1.30 % ------
% 1.79/1.30 % Current options:
% 1.79/1.30 % ------
% 1.79/1.30
% 1.79/1.30
% 1.79/1.30 %
% 1.79/1.30
% 1.79/1.30 % ------ Proving...
% 1.79/1.30 %
% 1.79/1.30
% 1.79/1.30 % SZS status Theorem for theBenchmark.p
% 1.79/1.30
% 1.79/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.79/1.30
% 1.79/1.30
%------------------------------------------------------------------------------