%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN319+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 : n018.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.59s 1.27s
% Output : CNFRefutation 1.59s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f15ERROR: Could not build tree for root c_147ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0,X1] :
! [X2,X3] :
( ( ( big_f(X1)
=> big_g(X2) )
=> ( ~ big_f(X2)
& big_g(X0) ) )
=> ( ( ( big_g(X0)
| big_f(X0) )
=> big_h(X0) )
=> ( ( big_h(X1)
=> ( ( big_g(X3)
| big_f(X3) )
=> big_h(X3) ) )
& big_h(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_2_5) ).
fof(f2,negated_conjecture,
~ ? [X0,X1] :
! [X2,X3] :
( ( ( big_f(X1)
=> big_g(X2) )
=> ( ~ big_f(X2)
& big_g(X0) ) )
=> ( ( ( big_g(X0)
| big_f(X0) )
=> big_h(X0) )
=> ( ( big_h(X1)
=> ( ( big_g(X3)
| big_f(X3) )
=> big_h(X3) ) )
& big_h(X3) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
! [X0,X1] :
? [X2,X3] :
( ( ( big_f(X1)
& ~ big_g(X2) )
| ( ~ big_f(X2)
& big_g(X0) ) )
& ( ( ~ big_g(X0)
& ~ big_f(X0) )
| big_h(X0) )
& ( ( big_h(X1)
& ( big_g(X3)
| big_f(X3) )
& ~ big_h(X3) )
| ~ big_h(X3) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
! [X0,X1] :
? [X2,X3] :
( ( ( big_f(X1)
& ~ big_g(X2) )
| ( ~ big_f(X2)
& big_g(X0) ) )
& ( ( ~ big_g(X0)
& ~ big_f(X0) )
| big_h(X0) )
& ( ( big_h(X1)
& ( big_g(X3)
| big_f(X3) )
& ~ big_h(X3) )
| ~ big_h(X3) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X0,X1] :
( ( ( big_f(X1)
& ~ big_g(sK0(X0,X1)) )
| ( ~ big_f(sK0(X0,X1))
& big_g(X0) ) )
& ( ( ~ big_g(X0)
& ~ big_f(X0) )
| big_h(X0) )
& ( ( big_h(X1)
& ( big_g(sK1(X0,X1))
| big_f(sK1(X0,X1)) )
& ~ big_h(sK1(X0,X1)) )
| ~ big_h(sK1(X0,X1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0(X0,X1)),skolemize(X3,sK1(X0,X1))],[f4]) ).
fof(f8,plain,
! [X0,X1] :
( big_f(X1)
| big_g(X0) ),
inference(cnf_transformation,[],[f5]) ).
fof(f10,plain,
! [X0] :
( ~ big_g(X0)
| big_h(X0) ),
inference(cnf_transformation,[],[f5]) ).
fof(f11,plain,
! [X0] :
( ~ big_f(X0)
| big_h(X0) ),
inference(cnf_transformation,[],[f5]) ).
fof(f13,plain,
! [X0,X1] :
( big_g(sK1(X0,X1))
| big_f(sK1(X0,X1))
| ~ big_h(sK1(X0,X1)) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_49,negated_conjecture,
! [X0: $i,X1: $i] : ~ big_h(sK1(X0,X1)),
inference(cnf_transformation,[],[f15]) ).
tcf(c_50,negated_conjecture,
! [X0: $i,X1: $i] :
( big_g(sK1(X0,X1))
| big_f(sK1(X0,X1))
| ~ big_h(sK1(X0,X1)) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_52,negated_conjecture,
! [X0: $i] :
( big_h(X0)
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_53,negated_conjecture,
! [X0: $i] :
( big_h(X0)
| ~ big_g(X0) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_55,negated_conjecture,
! [X0: $i,X1: $i] :
( big_g(X1)
| big_f(X0) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_67,negated_conjecture,
! [X0: $i,X1: $i] : ~ big_h(sK1(X0,X1)),
inference(global_subsumption_just,[status(thm)],[c_50,c_49]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i] : ~ big_g(sK1(X0,X1)),
inference(resolution,[status(thm)],[c_67,c_53]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i] : ~ big_f(sK1(X0,X1)),
inference(resolution,[status(thm)],[c_67,c_52]) ).
tcf(c_127,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_10
| big_g(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_55]) ).
tcf(c_128,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_11
| big_f(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_55]) ).
tcf(c_129,negated_conjecture,
( iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_55]) ).
tcf(c_134,negated_conjecture,
( iPr_def_11
| iPr_def_10 ),
inference(demodulation,[status(thm)],[c_129]) ).
tcf(c_135,negated_conjecture,
! [X0: $i] :
( big_f(X0)
| ~ iPr_def_11 ),
inference(demodulation,[status(thm)],[c_128]) ).
tcf(c_136,negated_conjecture,
! [X0: $i] :
( big_g(X0)
| ~ iPr_def_10 ),
inference(demodulation,[status(thm)],[c_127]) ).
tcf(c_141,plain,
! [X0: $i,X1: $i] :
( big_g(sK1(X0,X1))
| ~ iPr_def_10 ),
inference(instantiation,[status(thm)],[c_136]) ).
tcf(c_146,plain,
! [X0: $i,X1: $i] :
( big_f(sK1(X0,X1))
| ~ iPr_def_11 ),
inference(instantiation,[status(thm)],[c_135]) ).
tcf(c_147,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_146,c_141,c_134,c_100,c_95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN319+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.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 00:51:20 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 1.59/1.27 % SZS status Started for theBenchmark.p
% 1.59/1.27 % SZS status Theorem for theBenchmark.p
% 1.59/1.27
% 1.59/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.59/1.27
% 1.59/1.27 % ------ iProver source info
% 1.59/1.27
% 1.59/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.59/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.59/1.27 % git: non_committed_changes: false
% 1.59/1.27
% 1.59/1.27 % ------ Parsing...
% 1.59/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.59/1.27
% 1.59/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.59/1.27
% 1.59/1.27 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.59/1.27 % ------ Proving...
% 1.59/1.27 % ------ Problem Properties
% 1.59/1.27
% 1.59/1.27 %
% 1.59/1.27 % clauses 8
% 1.59/1.27 % conjectures 6
% 1.59/1.27 % EPR 3
% 1.59/1.27 % Horn 7
% 1.59/1.27 % unary 2
% 1.59/1.27 % binary 6
% 1.59/1.27 % lits 14
% 1.59/1.27 % lits eq 0
% 1.59/1.27 % fd_pure 0
% 1.59/1.27 % fd_pseudo 0
% 1.59/1.27 % fd_cond 0
% 1.59/1.27 % fd_pseudo_cond 0
% 1.59/1.27 % AC symbols 0
% 1.59/1.27
% 1.59/1.27 % ------ Schedule dynamic 5 is on
% 1.59/1.27
% 1.59/1.27 % ------ no equalities: superposition off
% 1.59/1.27
% 1.59/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.59/1.27
% 1.59/1.27
% 1.59/1.27 % ------
% 1.59/1.27 % Current options:
% 1.59/1.27 % ------
% 1.59/1.27
% 1.59/1.27
% 1.59/1.27 %
% 1.59/1.27
% 1.59/1.27 % ------ Proving...
% 1.59/1.27 %
% 1.59/1.27
% 1.59/1.27 % SZS status Theorem for theBenchmark.p
% 1.59/1.27
% 1.59/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.59/1.27
% 1.59/1.27
%------------------------------------------------------------------------------