%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN345+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 : 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:47 PM UTC 2026
% Result : Theorem 1.75s 1.15s
% Output : CNFRefutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 38 ( 4 unt; 0 def)
% Number of atoms : 150 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 177 ( 65 ~; 66 |; 24 &)
% ( 2 <=>; 18 =>; 0 <=; 2 <~>)
% Maximal formula depth : 13 ( 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 : 4 ( 3 usr; 3 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn 47 !; 13 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
? [X2,X3] :
! [X4] :
( ( ( big_f(X0,X1,X2)
=> big_f(X3,X2,X4) )
=> ( big_f(X0,X0,X1)
=> big_f(X0,X1,X1) ) )
=> ( ( ( big_f(X1,X2,X3)
=> big_f(X2,X4,X4) )
=> ( big_f(X0,X1,X1)
=> big_f(X0,X0,X1) ) )
=> ( big_f(X2,X3,X4)
=> ( ( big_f(X0,X0,X1)
<=> big_f(X0,X1,X1) )
& big_f(X1,X1,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_16_4) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
! [X4] :
( ( ( big_f(X0,X1,X2)
=> big_f(X3,X2,X4) )
=> ( big_f(X0,X0,X1)
=> big_f(X0,X1,X1) ) )
=> ( ( ( big_f(X1,X2,X3)
=> big_f(X2,X4,X4) )
=> ( big_f(X0,X1,X1)
=> big_f(X0,X0,X1) ) )
=> ( big_f(X2,X3,X4)
=> ( ( big_f(X0,X0,X1)
<=> big_f(X0,X1,X1) )
& big_f(X1,X1,X2) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ( big_f(X0,X1,X2)
& ~ big_f(X3,X2,X4) )
| ~ big_f(X0,X0,X1)
| big_f(X0,X1,X1) )
& ( ( big_f(X1,X2,X3)
& ~ big_f(X2,X4,X4) )
| ~ big_f(X0,X1,X1)
| big_f(X0,X0,X1) )
& big_f(X2,X3,X4)
& ( ( big_f(X0,X0,X1)
<~> big_f(X0,X1,X1) )
| ~ big_f(X1,X1,X2) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ( big_f(X0,X1,X2)
& ~ big_f(X3,X2,X4) )
| ~ big_f(X0,X0,X1)
| big_f(X0,X1,X1) )
& ( ( big_f(X1,X2,X3)
& ~ big_f(X2,X4,X4) )
| ~ big_f(X0,X1,X1)
| big_f(X0,X0,X1) )
& big_f(X2,X3,X4)
& ( ( big_f(X0,X0,X1)
<~> big_f(X0,X1,X1) )
| ~ big_f(X1,X1,X2) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ( big_f(X0,X1,X2)
& ~ big_f(X3,X2,X4) )
| ~ big_f(X0,X0,X1)
| big_f(X0,X1,X1) )
& ( ( big_f(X1,X2,X3)
& ~ big_f(X2,X4,X4) )
| ~ big_f(X0,X1,X1)
| big_f(X0,X0,X1) )
& big_f(X2,X3,X4)
& ( ( ( big_f(X0,X0,X1)
| big_f(X0,X1,X1) )
& ( ~ big_f(X0,X0,X1)
| ~ big_f(X0,X1,X1) ) )
| ~ big_f(X1,X1,X2) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
! [X2,X3] :
( ( ( big_f(sK0,sK1,X2)
& ~ big_f(X3,X2,sK2(X2,X3)) )
| ~ big_f(sK0,sK0,sK1)
| big_f(sK0,sK1,sK1) )
& ( ( big_f(sK1,X2,X3)
& ~ big_f(X2,sK2(X2,X3),sK2(X2,X3)) )
| ~ big_f(sK0,sK1,sK1)
| big_f(sK0,sK0,sK1) )
& big_f(X2,X3,sK2(X2,X3))
& ( ( ( big_f(sK0,sK0,sK1)
| big_f(sK0,sK1,sK1) )
& ( ~ big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1) ) )
| ~ big_f(sK1,sK1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X4,sK2(X2,X3))],[f5]) ).
fof(f7,plain,
! [X2] :
( big_f(sK0,sK1,X2)
| ~ big_f(sK0,sK0,sK1)
| big_f(sK0,sK1,sK1) ),
inference(cnf_transformation,[],[f6]) ).
fof(f9,plain,
! [X2,X3] :
( big_f(sK1,X2,X3)
| ~ big_f(sK0,sK1,sK1)
| big_f(sK0,sK0,sK1) ),
inference(cnf_transformation,[],[f6]) ).
fof(f10,plain,
! [X2,X3] :
( ~ big_f(X2,sK2(X2,X3),sK2(X2,X3))
| ~ big_f(sK0,sK1,sK1)
| big_f(sK0,sK0,sK1) ),
inference(cnf_transformation,[],[f6]) ).
fof(f11,plain,
! [X2,X3] : big_f(X2,X3,sK2(X2,X3)),
inference(cnf_transformation,[],[f6]) ).
fof(f12,plain,
! [X2] :
( big_f(sK0,sK0,sK1)
| big_f(sK0,sK1,sK1)
| ~ big_f(sK1,sK1,X2) ),
inference(cnf_transformation,[],[f6]) ).
fof(f13,plain,
! [X2] :
( ~ big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| ~ big_f(sK1,sK1,X2) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] :
( ~ big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| ~ big_f(sK1,sK1,X0) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] :
( big_f(sK0,sK0,sK1)
| big_f(sK0,sK1,sK1)
| ~ big_f(sK1,sK1,X0) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_51,negated_conjecture,
! [X0: $i,X1: $i] : big_f(X0,X1,sK2(X0,X1)),
inference(cnf_transformation,[],[f11]) ).
tcf(c_52,negated_conjecture,
! [X0: $i,X1: $i] :
( big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| ~ big_f(X0,sK2(X0,X1),sK2(X0,X1)) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_53,negated_conjecture,
! [X0: $i,X1: $i] :
( big_f(sK0,sK0,sK1)
| big_f(sK1,X0,X1)
| ~ big_f(sK0,sK1,sK1) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_55,negated_conjecture,
! [X0: $i] :
( big_f(sK0,sK1,sK1)
| big_f(sK0,sK1,X0)
| ~ big_f(sK0,sK0,sK1) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_56,plain,
big_f(sK1,sK1,sK2(sK1,sK1)),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_57,plain,
( big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_64,plain,
! [X0: $i] :
( ~ big_f(sK1,sK1,X0)
| big_f(sK0,sK1,sK1) ),
inference(global_subsumption_just,[status(thm)],[c_50,c_57,c_50]) ).
tcf(c_65,negated_conjecture,
! [X0: $i] :
( big_f(sK0,sK1,sK1)
| ~ big_f(sK1,sK1,X0) ),
inference(renaming,[status(thm)],[c_64]) ).
tcf(c_67,negated_conjecture,
! [X0: $i] :
( ~ big_f(sK0,sK0,sK1)
| ~ big_f(sK1,sK1,X0) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_49,c_65]) ).
tcf(c_124,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ iPr_def_10
| big_f(sK1,X0,X1) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_53]) ).
tcf(c_125,negated_conjecture,
( iPr_def_10
| big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1) ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_53]) ).
tcf(c_126,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ iPr_def_11
| ~ big_f(X0,sK2(X0,X1),sK2(X0,X1)) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_52]) ).
tcf(c_127,negated_conjecture,
( iPr_def_11
| big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1) ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_52]) ).
tcf(c_128,negated_conjecture,
! [X0: $i] :
( ~ big_f(sK0,sK0,sK1)
| ~ big_f(sK1,sK1,X0) ),
inference(demodulation,[status(thm)],[c_67]) ).
tcf(c_129,negated_conjecture,
! [X0: $i] :
( big_f(sK0,sK1,sK1)
| ~ big_f(sK1,sK1,X0) ),
inference(demodulation,[status(thm)],[c_65]) ).
tcf(c_131,negated_conjecture,
( iPr_def_10
| big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1) ),
inference(demodulation,[status(thm)],[c_125]) ).
tcf(c_132,negated_conjecture,
! [X0: $i,X1: $i] :
( big_f(sK1,X0,X1)
| ~ iPr_def_10 ),
inference(demodulation,[status(thm)],[c_124]) ).
tcf(c_133,negated_conjecture,
( iPr_def_11
| big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1) ),
inference(demodulation,[status(thm)],[c_127]) ).
tcf(c_134,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ iPr_def_11
| ~ big_f(X0,sK2(X0,X1),sK2(X0,X1)) ),
inference(demodulation,[status(thm)],[c_126]) ).
tcf(c_139,plain,
( big_f(sK0,sK1,sK1)
| ~ big_f(sK1,sK1,sK2(sK1,sK1)) ),
inference(instantiation,[status(thm)],[c_129]) ).
tcf(c_143,plain,
( ~ big_f(sK0,sK0,sK1)
| ~ big_f(sK1,sK1,sK2(sK1,sK1)) ),
inference(instantiation,[status(thm)],[c_128]) ).
tcf(c_144,plain,
! [X0: $i] :
( ~ iPr_def_11
| ~ big_f(sK1,sK2(sK1,X0),sK2(sK1,X0)) ),
inference(instantiation,[status(thm)],[c_134]) ).
tcf(c_145,plain,
! [X0: $i] :
( big_f(sK1,sK2(sK1,X0),sK2(sK1,X0))
| ~ iPr_def_10 ),
inference(instantiation,[status(thm)],[c_132]) ).
tcf(c_146,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_145,c_144,c_143,c_139,c_133,c_131,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN345+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.35 % Computer : n016.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Fri Sep 25 01:00:14 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.38 Running first-order theorem proving
% 0.13/0.38 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.39
% 0.13/0.39 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.39
% 0.13/0.39 % Detected problem language: tptp
% 0.13/0.40 % Proving...
% 1.75/1.15 % SZS status Started for theBenchmark.p
% 1.75/1.15 % SZS status Theorem for theBenchmark.p
% 1.75/1.15
% 1.75/1.15 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.75/1.15
% 1.75/1.15 % ------ iProver source info
% 1.75/1.15
% 1.75/1.15 % git: date: 2026-07-19 20:42:38 +0200
% 1.75/1.15 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.75/1.15 % git: non_committed_changes: false
% 1.75/1.15
% 1.75/1.15 % ------ Parsing...
% 1.75/1.15 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.75/1.15
% 1.75/1.15 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.75/1.15
% 1.75/1.15 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.75/1.15 % ------ Proving...
% 1.75/1.15 % ------ Problem Properties
% 1.75/1.15
% 1.75/1.15 %
% 1.75/1.15 % clauses 8
% 1.75/1.15 % conjectures 8
% 1.75/1.15 % EPR 6
% 1.75/1.15 % Horn 6
% 1.75/1.15 % unary 1
% 1.75/1.15 % binary 5
% 1.75/1.15 % lits 17
% 1.75/1.15 % lits eq 0
% 1.75/1.15 % fd_pure 0
% 1.75/1.15 % fd_pseudo 0
% 1.75/1.15 % fd_cond 0
% 1.75/1.15 % fd_pseudo_cond 0
% 1.75/1.15 % AC symbols 0
% 1.75/1.15
% 1.75/1.15 % ------ Schedule dynamic 5 is on
% 1.75/1.15
% 1.75/1.15 % ------ no equalities: superposition off
% 1.75/1.15
% 1.75/1.15 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.75/1.15
% 1.75/1.15
% 1.75/1.15 % ------
% 1.75/1.15 % Current options:
% 1.75/1.15 % ------
% 1.75/1.15
% 1.75/1.15
% 1.75/1.15 %
% 1.75/1.15
% 1.75/1.15 % ------ Proving...
% 1.75/1.15 %
% 1.75/1.15
% 1.75/1.15 % SZS status Theorem for theBenchmark.p
% 1.75/1.15
% 1.75/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.75/1.15
% 1.75/1.15
%------------------------------------------------------------------------------