%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV189+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n017.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:16:38 PM UTC 2026
% Result : Theorem 4.04s 6.72s
% Output : CNFRefutation 4.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 15 unt; 0 def)
% Number of atoms : 105 ( 19 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 105 ( 37 ~; 29 |; 28 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-3 aty)
% Number of variables : 48 ( 0 sgn 42 !; 6 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( leq(X1,X2)
& leq(X0,X1) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(f8,axiom,
! [X0,X1] :
( gt(X1,X0)
=> leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(f53,conjecture,
( ! [X0] :
( ( leq(X0,n4)
& leq(n0,X0) )
=> a_select3(center_init,X0,n0) = init )
=> ! [X1] :
( ( leq(X1,tptp_minus_1)
& leq(n0,X1) )
=> ! [X2] :
( ( leq(X2,n4)
& leq(n0,X2) )
=> a_select3(q_init,X1,X2) = init ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0121) ).
fof(f54,negated_conjecture,
~ ( ! [X0] :
( ( leq(X0,n4)
& leq(n0,X0) )
=> a_select3(center_init,X0,n0) = init )
=> ! [X1] :
( ( leq(X1,tptp_minus_1)
& leq(n0,X1) )
=> ! [X2] :
( ( leq(X2,n4)
& leq(n0,X2) )
=> a_select3(q_init,X1,X2) = init ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f58,axiom,
gt(n0,tptp_minus_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_0_tptp_minus_1) ).
fof(f78,axiom,
! [X0] :
( ( leq(X0,n0)
& leq(n0,X0) )
=> X0 = n0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',finite_domain_0) ).
fof(f87,plain,
( ! [X0] :
( ~ leq(X0,n4)
| ~ leq(n0,X0)
| a_select3(center_init,X0,n0) = init )
& ? [X1] :
( leq(X1,tptp_minus_1)
& leq(n0,X1)
& ? [X2] :
( leq(X2,n4)
& leq(n0,X2)
& init != a_select3(q_init,X1,X2) ) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f88,plain,
( ! [X0] :
( ~ leq(X0,n4)
| ~ leq(n0,X0)
| a_select3(center_init,X0,n0) = init )
& ? [X1] :
( leq(X1,tptp_minus_1)
& leq(n0,X1)
& ? [X2] :
( leq(X2,n4)
& leq(n0,X2)
& init != a_select3(q_init,X1,X2) ) ) ),
inference(flattening,[],[f87]) ).
fof(f89,plain,
! [X0] :
( ~ leq(X0,n0)
| ~ leq(n0,X0)
| X0 = n0 ),
inference(ennf_transformation,[],[f78]) ).
fof(f90,plain,
! [X0] :
( ~ leq(X0,n0)
| ~ leq(n0,X0)
| X0 = n0 ),
inference(flattening,[],[f89]) ).
fof(f95,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(flattening,[],[f96]) ).
fof(f110,plain,
( ! [X2] :
( ~ leq(X2,n4)
| ~ leq(n0,X2)
| init = a_select3(center_init,X2,n0) )
& ? [X0] :
( leq(X0,tptp_minus_1)
& leq(n0,X0)
& ? [X1] :
( leq(X1,n4)
& leq(n0,X1)
& init != a_select3(q_init,X0,X1) ) ) ),
inference(rectify,[],[f88]) ).
fof(f111,plain,
( ! [X2] :
( ~ leq(X2,n4)
| ~ leq(n0,X2)
| init = a_select3(center_init,X2,n0) )
& leq(sK0,tptp_minus_1)
& leq(n0,sK0)
& leq(sK1,n4)
& leq(n0,sK1)
& init != a_select3(q_init,sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f110]) ).
fof(f115,plain,
leq(sK0,tptp_minus_1),
inference(cnf_transformation,[],[f111]) ).
fof(f116,plain,
leq(n0,sK0),
inference(cnf_transformation,[],[f111]) ).
fof(f120,plain,
! [X0] :
( ~ leq(X0,n0)
| ~ leq(n0,X0)
| n0 = X0 ),
inference(cnf_transformation,[],[f90]) ).
fof(f128,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f95]) ).
fof(f129,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f97]) ).
fof(f134,plain,
gt(n0,tptp_minus_1),
inference(cnf_transformation,[],[f58]) ).
fof(f149,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
tcf(c_52,negated_conjecture,
leq(n0,sK0),
inference(cnf_transformation,[],[f116]) ).
tcf(c_53,negated_conjecture,
leq(sK0,tptp_minus_1),
inference(cnf_transformation,[],[f115]) ).
tcf(c_55,plain,
! [X0: $i] :
( ( X0 = n0 )
| ~ leq(n0,X0)
| ~ leq(X0,n0) ),
inference(cnf_transformation,[],[f120]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( leq(X1,X0)
| ~ gt(X0,X1) ),
inference(cnf_transformation,[],[f128]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f129]) ).
tcf(c_69,plain,
gt(n0,tptp_minus_1),
inference(cnf_transformation,[],[f134]) ).
tcf(c_84,plain,
! [X0: $i] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f149]) ).
tcf(c_1359,plain,
leq(tptp_minus_1,n0),
inference(superposition,[status(thm)],[c_69,c_63]) ).
tcf(c_2426,plain,
! [X0: $i] :
( leq(X0,tptp_minus_1)
| ~ leq(X0,sK0) ),
inference(superposition,[status(thm)],[c_53,c_64]) ).
tcf(c_2692,plain,
leq(n0,tptp_minus_1),
inference(superposition,[status(thm)],[c_52,c_2426]) ).
tcf(c_3157,plain,
( ( n0 = tptp_minus_1 )
| ~ leq(tptp_minus_1,n0) ),
inference(superposition,[status(thm)],[c_2692,c_55]) ).
tcf(c_3165,plain,
n0 = tptp_minus_1,
inference(forward_subsumption_resolution,[status(thm)],[c_3157,c_1359]) ).
tcf(c_3181,plain,
gt(n0,n0),
inference(demodulation,[status(thm)],[c_69,c_3165]) ).
tcf(c_3186,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3181,c_84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV189+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/5.81 % Computer : n017.cluster.edu
% 0.12/5.81 % Model : x86_64 x86_64
% 0.12/5.81 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.81 % Memory : 8046.5625MB
% 0.12/5.81 % OS : Linux 6.8.0-71-generic
% 0.12/5.81 % CPULimit : 300
% 0.12/5.81 % WCLimit : 300
% 0.12/5.81 % DateTime : Thu Sep 24 18:38:52 UTC 2026
% 0.12/5.81 % CPUTime :
% 0.12/5.81 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/5.85 Running first-order theorem proving
% 0.12/5.85 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.12/5.86
% 0.12/5.86 % ======== iProver multi-core TPTP/SMT =========
% 0.12/5.86
% 0.12/5.86 % Detected problem language: tptp
% 0.12/5.87 % Proving...
% 4.04/6.72 % SZS status Started for theBenchmark.p
% 4.04/6.72 % SZS status Theorem for theBenchmark.p
% 4.04/6.72
% 4.04/6.72 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.04/6.72
% 4.04/6.72 % ------ iProver source info
% 4.04/6.72
% 4.04/6.72 % git: date: 2026-07-19 20:42:38 +0200
% 4.04/6.72 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.04/6.72 % git: non_committed_changes: false
% 4.04/6.72
% 4.04/6.72 % ------ Parsing...
% 4.04/6.72 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.04/6.72
% 4.04/6.72 % ------ Preprocessing... sup_sim: 10 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.04/6.72
% 4.04/6.72 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.04/6.72
% 4.04/6.72 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.04/6.72 % ------ Proving...
% 4.04/6.72 % ------ Problem Properties
% 4.04/6.72
% 4.04/6.72 %
% 4.04/6.72 % clauses 62
% 4.04/6.72 % conjectures 6
% 4.04/6.72 % EPR 38
% 4.04/6.72 % Horn 55
% 4.04/6.72 % unary 44
% 4.04/6.72 % binary 7
% 4.04/6.72 % lits 106
% 4.04/6.72 % lits eq 40
% 4.04/6.72 % fd_pure 0
% 4.04/6.72 % fd_pseudo 0
% 4.04/6.72 % fd_cond 6
% 4.04/6.72 % fd_pseudo_cond 2
% 4.04/6.72 % AC symbols 0
% 4.04/6.72
% 4.04/6.72 % ------ Schedule dynamic 5 is on
% 4.04/6.72
% 4.04/6.72 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.04/6.72
% 4.04/6.72
% 4.04/6.72 % ------
% 4.04/6.72 % Current options:
% 4.04/6.72 % ------
% 4.04/6.72
% 4.04/6.72
% 4.04/6.72 %
% 4.04/6.72
% 4.04/6.72 % ------ Proving...
% 4.04/6.72 %
% 4.04/6.72
% 4.04/6.72 % SZS status Theorem for theBenchmark.p
% 4.04/6.72
% 4.04/6.72 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.04/6.72
% 4.04/6.72
%------------------------------------------------------------------------------