%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN359+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 : n026.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:51 PM UTC 2026
% Result : Theorem 1.51s 1.25s
% Output : CNFRefutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 22 ( 7 unt; 1 def)
% Number of atoms : 74 ( 1 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 79 ( 29 ~; 20 |; 21 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 59 ( 0 sgn 41 !; 18 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X0,X1] :
( big_q(X0,X1)
=> big_q(X0,X0) )
& ! [X1] :
( big_r(X1)
=> ? [X2] : big_q(X1,X2) )
& ? [X0] : big_r(X0) )
=> ? [X0,X1] :
( big_r(X1)
& big_q(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2110) ).
fof(f2,negated_conjecture,
~ ( ( ! [X0,X1] :
( big_q(X0,X1)
=> big_q(X0,X0) )
& ! [X1] :
( big_r(X1)
=> ? [X2] : big_q(X1,X2) )
& ? [X0] : big_r(X0) )
=> ? [X0,X1] :
( big_r(X1)
& big_q(X0,X1) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ( ! [X3,X4] :
( big_q(X3,X4)
=> big_q(X3,X3) )
& ! [X1] :
( big_r(X1)
=> ? [X2] : big_q(X1,X2) )
& ? [X0] : big_r(X0) )
=> ? [X5,X6] :
( big_r(X6)
& big_q(X5,X6) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X3,X4] :
( ~ big_q(X3,X4)
| big_q(X3,X3) )
& ! [X1] :
( ~ big_r(X1)
| ? [X2] : big_q(X1,X2) )
& ? [X0] : big_r(X0)
& ! [X5,X6] :
( ~ big_r(X6)
| ~ big_q(X5,X6) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X3,X4] :
( ~ big_q(X3,X4)
| big_q(X3,X3) )
& ! [X1] :
( ~ big_r(X1)
| ? [X2] : big_q(X1,X2) )
& ? [X0] : big_r(X0)
& ! [X5,X6] :
( ~ big_r(X6)
| ~ big_q(X5,X6) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ! [X5,X6] :
( ~ big_q(X5,X6)
| big_q(X5,X5) )
& ! [X3] :
( ~ big_r(X3)
| ? [X4] : big_q(X3,X4) )
& ? [X2] : big_r(X2)
& ! [X0,X1] :
( ~ big_r(X1)
| ~ big_q(X0,X1) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ! [X5,X6] :
( ~ big_q(X5,X6)
| big_q(X5,X5) )
& ! [X3] :
( ~ big_r(X3)
| big_q(X3,sK1(X3)) )
& big_r(sK0)
& ! [X0,X1] :
( ~ big_r(X1)
| ~ big_q(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0),skolemize(X4,sK1(X3))],[f6]) ).
fof(f8,plain,
! [X6,X5] :
( ~ big_q(X5,X6)
| big_q(X5,X5) ),
inference(cnf_transformation,[],[f7]) ).
fof(f9,plain,
! [X3] :
( ~ big_r(X3)
| big_q(X3,sK1(X3)) ),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
big_r(sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X0,X1] :
( ~ big_r(X1)
| ~ big_q(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_49,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ big_r(X1)
| ~ big_q(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_50,negated_conjecture,
big_r(sK0),
inference(cnf_transformation,[],[f10]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( big_q(X0,sK1(X0))
| ~ big_r(X0) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_52,negated_conjecture,
! [X0: $i,X1: $i] :
( big_q(X0,X0)
| ~ big_q(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_54,plain,
( ~ big_r(sK0)
| ~ big_q(sK0,sK0) ),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_74,plain,
big_q(sK0,sK1(sK0)),
inference(resolution,[status(thm)],[c_50,c_51]) ).
tcf(c_88,definition,
iPr_def_10 = sK1(sK0),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_89,plain,
big_q(sK0,iPr_def_10),
inference(demodulation,[status(thm)],[c_74,c_88]) ).
tcf(c_91,negated_conjecture,
! [X0: $i,X1: $i] :
( big_q(X0,X0)
| ~ big_q(X0,X1) ),
inference(demodulation,[status(thm)],[c_52]) ).
tcf(c_164,plain,
big_q(sK0,sK0),
inference(superposition,[status(thm)],[c_89,c_91]) ).
tcf(c_165,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_164,c_54,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN359+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.09/0.35 % Computer : n026.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:01:39 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.39 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.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.41 % Proving...
% 1.51/1.25 % SZS status Started for theBenchmark.p
% 1.51/1.25 % SZS status Theorem for theBenchmark.p
% 1.51/1.25
% 1.51/1.25 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.51/1.25
% 1.51/1.25 % ------ iProver source info
% 1.51/1.25
% 1.51/1.25 % git: date: 2026-07-19 20:42:38 +0200
% 1.51/1.25 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.51/1.25 % git: non_committed_changes: false
% 1.51/1.25
% 1.51/1.25 % ------ Parsing...
% 1.51/1.25 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.51/1.25
% 1.51/1.25 % ------ 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.51/1.25
% 1.51/1.25 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.51/1.25
% 1.51/1.25 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.51/1.25 % ------ Proving...
% 1.51/1.25 % ------ Problem Properties
% 1.51/1.25
% 1.51/1.25 %
% 1.51/1.25 % clauses 4
% 1.51/1.25 % conjectures 1
% 1.51/1.25 % EPR 3
% 1.51/1.25 % Horn 4
% 1.51/1.25 % unary 3
% 1.51/1.25 % binary 1
% 1.51/1.25 % lits 5
% 1.51/1.25 % lits eq 1
% 1.51/1.25 % fd_pure 0
% 1.51/1.25 % fd_pseudo 0
% 1.51/1.25 % fd_cond 0
% 1.51/1.25 % fd_pseudo_cond 0
% 1.51/1.25 % AC symbols 0
% 1.51/1.25
% 1.51/1.25 % ------ Schedule dynamic 5 is on
% 1.51/1.25
% 1.51/1.25 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.51/1.25
% 1.51/1.25
% 1.51/1.25 % ------
% 1.51/1.25 % Current options:
% 1.51/1.25 % ------
% 1.51/1.25
% 1.51/1.25
% 1.51/1.25 %
% 1.51/1.25
% 1.51/1.25 % ------ Proving...
% 1.51/1.25 %
% 1.51/1.25
% 1.51/1.25 % SZS status Theorem for theBenchmark.p
% 1.51/1.25
% 1.51/1.25 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.51/1.25
% 1.51/1.25
%------------------------------------------------------------------------------