%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN058+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 : n013.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:01 PM UTC 2026
% Result : Theorem 1.16s 1.29s
% Output : CNFRefutation 1.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 40 ( 7 unt; 0 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 91 ( 39 ~; 32 |; 13 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 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 : 14 ( 13 usr; 8 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 38 ( 0 sgn 29 !; 9 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( big_p(X0)
=> ! [X1] : big_q(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28_1) ).
fof(f2,axiom,
( ! [X0] :
( big_r(X0)
| big_q(X0) )
=> ? [X1] :
( big_s(X1)
& big_q(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28_2) ).
fof(f3,axiom,
( ? [X0] : big_s(X0)
=> ! [X1] :
( big_f(X1)
=> big_g(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28_3) ).
fof(f4,conjecture,
! [X0] :
( ( big_f(X0)
& big_p(X0) )
=> big_g(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28) ).
fof(f5,negated_conjecture,
~ ! [X0] :
( ( big_f(X0)
& big_p(X0) )
=> big_g(X0) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
( ! [X0] : big_q(X0)
=> ? [X1] :
( big_s(X1)
& big_q(X1) ) ),
inference(pure_predicate_removal,[],[f2]) ).
fof(f7,plain,
! [X0] :
( ~ big_p(X0)
| ! [X1] : big_q(X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f8,plain,
( ? [X0] : ~ big_q(X0)
| ? [X1] :
( big_s(X1)
& big_q(X1) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f9,plain,
( ! [X0] : ~ big_s(X0)
| ! [X1] :
( ~ big_f(X1)
| big_g(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f10,plain,
? [X0] :
( big_f(X0)
& big_p(X0)
& ~ big_g(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f11,plain,
? [X0] :
( big_f(X0)
& big_p(X0)
& ~ big_g(X0) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
( ? [X1] : ~ big_q(X1)
| ? [X0] :
( big_s(X0)
& big_q(X0) ) ),
inference(rectify,[],[f8]) ).
fof(f13,plain,
( ~ big_q(sK1)
| ( big_s(sK0)
& big_q(sK0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f12]) ).
fof(f14,plain,
( ! [X1] : ~ big_s(X1)
| ! [X0] :
( ~ big_f(X0)
| big_g(X0) ) ),
inference(rectify,[],[f9]) ).
fof(f15,plain,
( big_f(sK2)
& big_p(sK2)
& ~ big_g(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f11]) ).
fof(f16,plain,
! [X0,X1] :
( ~ big_p(X0)
| big_q(X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f17,plain,
( ~ big_q(sK1)
| big_s(sK0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
! [X0,X1] :
( ~ big_s(X1)
| ~ big_f(X0)
| big_g(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f20,plain,
big_f(sK2),
inference(cnf_transformation,[],[f15]) ).
fof(f21,plain,
big_p(sK2),
inference(cnf_transformation,[],[f15]) ).
fof(f22,plain,
~ big_g(sK2),
inference(cnf_transformation,[],[f15]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( big_q(X1)
| ~ big_p(X0) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_51,plain,
( big_s(sK0)
| ~ big_q(sK1) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( big_g(X1)
| ~ big_f(X1)
| ~ big_s(X0) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_53,negated_conjecture,
~ big_g(sK2),
inference(cnf_transformation,[],[f22]) ).
tcf(c_54,negated_conjecture,
big_p(sK2),
inference(cnf_transformation,[],[f21]) ).
tcf(c_55,negated_conjecture,
big_f(sK2),
inference(cnf_transformation,[],[f20]) ).
tcf(c_61,plain,
! [X0_iProver_big_f_1: iProver_big_f_1,X0_iProver_big_s_1: iProver_big_s_1] :
( big_g(X0_iProver_big_f_1)
| ~ big_f(X0_iProver_big_f_1)
| ~ big_s(X0_iProver_big_s_1) ),
inference(subtyping,[status(esa)],[c_52]) ).
tcf(c_63,plain,
! [X0_iProver_big_f_1: iProver_big_f_1,X0_iProver_big_q_1: iProver_big_q_1] :
( big_q(X0_iProver_big_q_1)
| ~ big_p(X0_iProver_big_f_1) ),
inference(subtyping,[status(esa)],[c_49]) ).
tcf(c_64,plain,
! [X0_iProver_big_q_1: iProver_big_q_1] :
( ~ iPr_def_10
| big_q(X0_iProver_big_q_1) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_63]) ).
tcf(c_65,plain,
! [X0_iProver_big_f_1: iProver_big_f_1] :
( ~ iPr_def_11
| ~ big_p(X0_iProver_big_f_1) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_63]) ).
tcf(c_66,plain,
( iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_63]) ).
tcf(c_67,plain,
! [X0_iProver_big_f_1: iProver_big_f_1] :
( ~ iPr_def_12
| big_g(X0_iProver_big_f_1)
| ~ big_f(X0_iProver_big_f_1) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_12])],[c_61]) ).
tcf(c_68,plain,
! [X0_iProver_big_s_1: iProver_big_s_1] :
( ~ iPr_def_13
| ~ big_s(X0_iProver_big_s_1) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_13])],[c_61]) ).
tcf(c_69,plain,
( iPr_def_13
| iPr_def_12 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_61]) ).
tcf(c_73,plain,
( big_q(sK1)
| ~ iPr_def_10 ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_74,plain,
( ~ iPr_def_11
| ~ big_p(sK2) ),
inference(instantiation,[status(thm)],[c_65]) ).
tcf(c_75,plain,
( ~ iPr_def_13
| ~ big_s(sK0) ),
inference(instantiation,[status(thm)],[c_68]) ).
tcf(c_76,plain,
( big_g(sK2)
| ~ iPr_def_12
| ~ big_f(sK2) ),
inference(instantiation,[status(thm)],[c_67]) ).
tcf(c_77,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_76,c_75,c_74,c_73,c_69,c_66,c_51,c_53,c_54,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN058+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.37 % Computer : n013.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 23:58:21 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.16/0.43
% 0.16/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.16/0.43
% 0.16/0.43 % Detected problem language: tptp
% 0.16/0.44 % Proving...
% 1.16/1.29 % SZS status Started for theBenchmark.p
% 1.16/1.29 % SZS status Theorem for theBenchmark.p
% 1.16/1.29
% 1.16/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.16/1.29
% 1.16/1.29 % ------ iProver source info
% 1.16/1.29
% 1.16/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.16/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.16/1.29 % git: non_committed_changes: false
% 1.16/1.29
% 1.16/1.29 % ------ Parsing...
% 1.16/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 1.16/1.29 %
% 1.16/1.29
% 1.16/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e %
% 1.16/1.29
% 1.16/1.29 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 1.16/1.29 gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.16/1.29 % ------ Proving...
% 1.16/1.29 % ------ Problem Properties
% 1.16/1.29
% 1.16/1.29 %
% 1.16/1.29 % clauses 10
% 1.16/1.29 % conjectures 3
% 1.16/1.29 % EPR 10
% 1.16/1.29 % Horn 8
% 1.16/1.29 % unary 3
% 1.16/1.29 % binary 6
% 1.16/1.29 % lits 18
% 1.16/1.29 % lits eq 0
% 1.16/1.29 % fd_pure 0
% 1.16/1.29 % fd_pseudo 0
% 1.16/1.29 % fd_cond 0
% 1.16/1.29 % fd_pseudo_cond 0
% 1.16/1.29 % AC symbols 0
% 1.16/1.29
% 1.16/1.29 % ------ Schedule EPR non Horn non eq is on
% 1.16/1.29
% 1.16/1.29 % ------ no equalities: superposition off
% 1.16/1.29
% 1.16/1.29 % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.16/1.29
% 1.16/1.29
% 1.16/1.29 % ------
% 1.16/1.29 % Current options:
% 1.16/1.29 % ------
% 1.16/1.29
% 1.16/1.29
% 1.16/1.29 %
% 1.16/1.29
% 1.16/1.29 % ------ Proving...
% 1.16/1.29 %
% 1.16/1.29
% 1.16/1.29 % SZS status Theorem for theBenchmark.p
% 1.16/1.29
% 1.16/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.16/1.29
% 1.16/1.29
%------------------------------------------------------------------------------