%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN065+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 : n012.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:04 PM UTC 2026
% Result : Theorem 1.06s 1.06s
% Output : CNFRefutation 1.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 17 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 37 ( 21 ~; 12 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 36 ( 0 sgn 31 !; 5 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
? [X1] : big_f(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel36_1) ).
fof(f2,axiom,
! [X0] :
? [X1] : big_g(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel36_2) ).
fof(f3,axiom,
! [X0,X1] :
( ( big_g(X0,X1)
| big_f(X0,X1) )
=> ! [X2] :
( ( big_g(X1,X2)
| big_f(X1,X2) )
=> big_h(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel36_3) ).
fof(f4,conjecture,
! [X0] :
? [X1] : big_h(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel36) ).
fof(f5,negated_conjecture,
~ ! [X0] :
? [X1] : big_h(X0,X1),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [X0,X1] :
( ( ~ big_g(X0,X1)
& ~ big_f(X0,X1) )
| ! [X2] :
( ( ~ big_g(X1,X2)
& ~ big_f(X1,X2) )
| big_h(X0,X2) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f7,plain,
? [X0] :
! [X1] : ~ big_h(X0,X1),
inference(ennf_transformation,[],[f5]) ).
fof(f8,plain,
! [X0] : big_f(X0,sK0(X0)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f1]) ).
fof(f9,plain,
! [X0] : big_g(X0,sK1(X0)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f2]) ).
fof(f10,plain,
! [X1] : ~ big_h(sK2,X1),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f7]) ).
fof(f11,plain,
! [X0] : big_f(X0,sK0(X0)),
inference(cnf_transformation,[],[f8]) ).
fof(f12,plain,
! [X0] : big_g(X0,sK1(X0)),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
! [X2,X0,X1] :
( ~ big_g(X0,X1)
| ~ big_f(X1,X2)
| big_h(X0,X2) ),
inference(cnf_transformation,[],[f6]) ).
fof(f17,plain,
! [X1] : ~ big_h(sK2,X1),
inference(cnf_transformation,[],[f10]) ).
tcf(c_49,plain,
! [X0: $i] : big_f(X0,sK0(X0)),
inference(cnf_transformation,[],[f11]) ).
tcf(c_50,plain,
! [X0: $i] : big_g(X0,sK1(X0)),
inference(cnf_transformation,[],[f12]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] :
( big_h(X2,X1)
| ~ big_g(X2,X0)
| ~ big_f(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_55,negated_conjecture,
! [X0: $i] : ~ big_h(sK2,X0),
inference(cnf_transformation,[],[f17]) ).
tcf(c_57,plain,
big_g(sK2,sK1(sK2)),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_114,plain,
! [X0: $i,X1: $i] :
( ~ big_g(sK2,X0)
| ~ big_f(X0,X1) ),
inference(resolution,[status(thm)],[c_52,c_55]) ).
tcf(c_149,plain,
! [X0: $i,X1: $i] :
( ~ big_g(sK2,X0)
| ~ big_f(X0,X1) ),
inference(demodulation,[status(thm)],[c_114]) ).
tcf(c_153,plain,
! [X0: $i] :
( ~ big_g(sK2,sK1(sK2))
| ~ big_f(sK1(sK2),X0) ),
inference(instantiation,[status(thm)],[c_149]) ).
tcf(c_169,plain,
( ~ big_g(sK2,sK1(sK2))
| ~ big_f(sK1(sK2),sK0(sK1(sK2))) ),
inference(instantiation,[status(thm)],[c_153]) ).
tcf(c_170,plain,
big_f(sK1(sK2),sK0(sK1(sK2))),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_171,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_170,c_169,c_57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN065+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Fri Sep 25 00:01:06 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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.06/0.33
% 0.06/0.33 % ======== iProver multi-core TPTP/SMT =========
% 0.06/0.33
% 0.06/0.33 % Detected problem language: tptp
% 0.06/0.34 % Proving...
% 1.06/1.06 % SZS status Started for theBenchmark.p
% 1.06/1.06 % SZS status Theorem for theBenchmark.p
% 1.06/1.06
% 1.06/1.06 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.06/1.06
% 1.06/1.06 % ------ iProver source info
% 1.06/1.06
% 1.06/1.06 % git: date: 2026-07-19 20:42:38 +0200
% 1.06/1.06 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.06/1.06 % git: non_committed_changes: false
% 1.06/1.06
% 1.06/1.06 % ------ Parsing...
% 1.06/1.06 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.06/1.06
% 1.06/1.06 % ------ 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.06/1.06
% 1.06/1.06 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.06/1.06 % ------ Proving...
% 1.06/1.06 % ------ Problem Properties
% 1.06/1.06
% 1.06/1.06 %
% 1.06/1.06 % clauses 6
% 1.06/1.06 % conjectures 0
% 1.06/1.06 % EPR 4
% 1.06/1.06 % Horn 6
% 1.06/1.06 % unary 2
% 1.06/1.06 % binary 4
% 1.06/1.06 % lits 10
% 1.06/1.06 % lits eq 0
% 1.06/1.06 % fd_pure 0
% 1.06/1.06 % fd_pseudo 0
% 1.06/1.06 % fd_cond 0
% 1.06/1.06 % fd_pseudo_cond 0
% 1.06/1.06 % AC symbols 0
% 1.06/1.06
% 1.06/1.06 % ------ Schedule dynamic 5 is on
% 1.06/1.06
% 1.06/1.06 % ------ no conjectures: strip conj schedule
% 1.06/1.06
% 1.06/1.06 % ------ no equalities: superposition off
% 1.06/1.06
% 1.06/1.06 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.06/1.06
% 1.06/1.06
% 1.06/1.06 % ------
% 1.06/1.06 % Current options:
% 1.06/1.06 % ------
% 1.06/1.06
% 1.06/1.06
% 1.06/1.06 %
% 1.06/1.06
% 1.06/1.06 % ------ Proving...
% 1.06/1.06 %
% 1.06/1.06
% 1.06/1.06 % SZS status Theorem for theBenchmark.p
% 1.06/1.06
% 1.06/1.06 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.06/1.07
% 1.06/1.07
%------------------------------------------------------------------------------