TSTP Solution File: SWV188+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV188+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 17:09:38 EDT 2024
% Result : Theorem 3.90s 1.13s
% Output : CNFRefutation 3.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 15 unt; 0 def)
% Number of atoms : 281 ( 67 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 347 ( 115 ~; 114 |; 78 &)
% ( 0 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 15 con; 0-3 aty)
% Number of variables : 113 ( 0 sgn 90 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( X0 = X1
| gt(X1,X0)
| gt(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',totality) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( gt(X1,X2)
& gt(X0,X1) )
=> gt(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_gt) ).
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',irreflexivity_gt) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( leq(X1,X2)
& leq(X0,X1) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_leq) ).
fof(f9,axiom,
! [X0,X1] :
( ( X0 != X1
& leq(X0,X1) )
=> gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_gt2) ).
fof(f53,conjecture,
( ( ( gt(loopcounter,n1)
=> ! [X27] :
( ( leq(X27,n4)
& leq(n0,X27) )
=> init = a_select2(sigmaold_init,X27) ) )
& ( gt(loopcounter,n1)
=> ! [X21] :
( ( leq(X21,n4)
& leq(n0,X21) )
=> init = a_select2(rhoold_init,X21) ) )
& ( gt(loopcounter,n1)
=> ! [X20] :
( ( leq(X20,n4)
& leq(n0,X20) )
=> init = a_select2(muold_init,X20) ) )
& ! [X19] :
( ( leq(X19,n4)
& leq(n0,X19) )
=> init = a_select3(center_init,X19,n0) )
& ! [X3] :
( ( leq(X3,n4)
& leq(n0,X3) )
=> init = a_select2(rho_init,X3) )
& ! [X13] :
( ( leq(X13,n135299)
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,n4)
& leq(n0,X17) )
=> a_select3(q_init,X13,X17) = init ) ) )
=> ! [X28] :
( ( leq(X28,tptp_minus_1)
& leq(n0,X28) )
=> init = a_select2(mu_init,X28) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0116) ).
fof(f54,negated_conjecture,
~ ( ( ( gt(loopcounter,n1)
=> ! [X27] :
( ( leq(X27,n4)
& leq(n0,X27) )
=> init = a_select2(sigmaold_init,X27) ) )
& ( gt(loopcounter,n1)
=> ! [X21] :
( ( leq(X21,n4)
& leq(n0,X21) )
=> init = a_select2(rhoold_init,X21) ) )
& ( gt(loopcounter,n1)
=> ! [X20] :
( ( leq(X20,n4)
& leq(n0,X20) )
=> init = a_select2(muold_init,X20) ) )
& ! [X19] :
( ( leq(X19,n4)
& leq(n0,X19) )
=> init = a_select3(center_init,X19,n0) )
& ! [X3] :
( ( leq(X3,n4)
& leq(n0,X3) )
=> init = a_select2(rho_init,X3) )
& ! [X13] :
( ( leq(X13,n135299)
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,n4)
& leq(n0,X17) )
=> a_select3(q_init,X13,X17) = init ) ) )
=> ! [X28] :
( ( leq(X28,tptp_minus_1)
& leq(n0,X28) )
=> init = a_select2(mu_init,X28) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f61,axiom,
gt(n0,tptp_minus_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_0_tptp_minus_1) ).
fof(f114,plain,
~ ( ( ( gt(loopcounter,n1)
=> ! [X0] :
( ( leq(X0,n4)
& leq(n0,X0) )
=> init = a_select2(sigmaold_init,X0) ) )
& ( gt(loopcounter,n1)
=> ! [X1] :
( ( leq(X1,n4)
& leq(n0,X1) )
=> init = a_select2(rhoold_init,X1) ) )
& ( gt(loopcounter,n1)
=> ! [X2] :
( ( leq(X2,n4)
& leq(n0,X2) )
=> init = a_select2(muold_init,X2) ) )
& ! [X3] :
( ( leq(X3,n4)
& leq(n0,X3) )
=> init = a_select3(center_init,X3,n0) )
& ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> init = a_select2(rho_init,X4) )
& ! [X5] :
( ( leq(X5,n135299)
& leq(n0,X5) )
=> ! [X6] :
( ( leq(X6,n4)
& leq(n0,X6) )
=> init = a_select3(q_init,X5,X6) ) ) )
=> ! [X7] :
( ( leq(X7,tptp_minus_1)
& leq(n0,X7) )
=> init = a_select2(mu_init,X7) ) ),
inference(rectify,[],[f54]) ).
fof(f116,plain,
! [X0,X1,X2] :
( gt(X0,X2)
| ~ gt(X1,X2)
| ~ gt(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f117,plain,
! [X0,X1,X2] :
( gt(X0,X2)
| ~ gt(X1,X2)
| ~ gt(X0,X1) ),
inference(flattening,[],[f116]) ).
fof(f118,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f119,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(flattening,[],[f118]) ).
fof(f121,plain,
! [X0,X1] :
( gt(X1,X0)
| X0 = X1
| ~ leq(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f122,plain,
! [X0,X1] :
( gt(X1,X0)
| X0 = X1
| ~ leq(X0,X1) ),
inference(flattening,[],[f121]) ).
fof(f156,plain,
( ? [X7] :
( init != a_select2(mu_init,X7)
& leq(X7,tptp_minus_1)
& leq(n0,X7) )
& ( ! [X0] :
( init = a_select2(sigmaold_init,X0)
| ~ leq(X0,n4)
| ~ leq(n0,X0) )
| ~ gt(loopcounter,n1) )
& ( ! [X1] :
( init = a_select2(rhoold_init,X1)
| ~ leq(X1,n4)
| ~ leq(n0,X1) )
| ~ gt(loopcounter,n1) )
& ( ! [X2] :
( init = a_select2(muold_init,X2)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
| ~ gt(loopcounter,n1) )
& ! [X3] :
( init = a_select3(center_init,X3,n0)
| ~ leq(X3,n4)
| ~ leq(n0,X3) )
& ! [X4] :
( init = a_select2(rho_init,X4)
| ~ leq(X4,n4)
| ~ leq(n0,X4) )
& ! [X5] :
( ! [X6] :
( init = a_select3(q_init,X5,X6)
| ~ leq(X6,n4)
| ~ leq(n0,X6) )
| ~ leq(X5,n135299)
| ~ leq(n0,X5) ) ),
inference(ennf_transformation,[],[f114]) ).
fof(f157,plain,
( ? [X7] :
( init != a_select2(mu_init,X7)
& leq(X7,tptp_minus_1)
& leq(n0,X7) )
& ( ! [X0] :
( init = a_select2(sigmaold_init,X0)
| ~ leq(X0,n4)
| ~ leq(n0,X0) )
| ~ gt(loopcounter,n1) )
& ( ! [X1] :
( init = a_select2(rhoold_init,X1)
| ~ leq(X1,n4)
| ~ leq(n0,X1) )
| ~ gt(loopcounter,n1) )
& ( ! [X2] :
( init = a_select2(muold_init,X2)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
| ~ gt(loopcounter,n1) )
& ! [X3] :
( init = a_select3(center_init,X3,n0)
| ~ leq(X3,n4)
| ~ leq(n0,X3) )
& ! [X4] :
( init = a_select2(rho_init,X4)
| ~ leq(X4,n4)
| ~ leq(n0,X4) )
& ! [X5] :
( ! [X6] :
( init = a_select3(q_init,X5,X6)
| ~ leq(X6,n4)
| ~ leq(n0,X6) )
| ~ leq(X5,n135299)
| ~ leq(n0,X5) ) ),
inference(flattening,[],[f156]) ).
fof(f224,plain,
( ? [X0] :
( init != a_select2(mu_init,X0)
& leq(X0,tptp_minus_1)
& leq(n0,X0) )
& ( ! [X1] :
( init = a_select2(sigmaold_init,X1)
| ~ leq(X1,n4)
| ~ leq(n0,X1) )
| ~ gt(loopcounter,n1) )
& ( ! [X2] :
( init = a_select2(rhoold_init,X2)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
| ~ gt(loopcounter,n1) )
& ( ! [X3] :
( init = a_select2(muold_init,X3)
| ~ leq(X3,n4)
| ~ leq(n0,X3) )
| ~ gt(loopcounter,n1) )
& ! [X4] :
( init = a_select3(center_init,X4,n0)
| ~ leq(X4,n4)
| ~ leq(n0,X4) )
& ! [X5] :
( init = a_select2(rho_init,X5)
| ~ leq(X5,n4)
| ~ leq(n0,X5) )
& ! [X6] :
( ! [X7] :
( init = a_select3(q_init,X6,X7)
| ~ leq(X7,n4)
| ~ leq(n0,X7) )
| ~ leq(X6,n135299)
| ~ leq(n0,X6) ) ),
inference(rectify,[],[f157]) ).
fof(f225,plain,
( ? [X0] :
( init != a_select2(mu_init,X0)
& leq(X0,tptp_minus_1)
& leq(n0,X0) )
=> ( init != a_select2(mu_init,sK31)
& leq(sK31,tptp_minus_1)
& leq(n0,sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f226,plain,
( init != a_select2(mu_init,sK31)
& leq(sK31,tptp_minus_1)
& leq(n0,sK31)
& ( ! [X1] :
( init = a_select2(sigmaold_init,X1)
| ~ leq(X1,n4)
| ~ leq(n0,X1) )
| ~ gt(loopcounter,n1) )
& ( ! [X2] :
( init = a_select2(rhoold_init,X2)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
| ~ gt(loopcounter,n1) )
& ( ! [X3] :
( init = a_select2(muold_init,X3)
| ~ leq(X3,n4)
| ~ leq(n0,X3) )
| ~ gt(loopcounter,n1) )
& ! [X4] :
( init = a_select3(center_init,X4,n0)
| ~ leq(X4,n4)
| ~ leq(n0,X4) )
& ! [X5] :
( init = a_select2(rho_init,X5)
| ~ leq(X5,n4)
| ~ leq(n0,X5) )
& ! [X6] :
( ! [X7] :
( init = a_select3(q_init,X6,X7)
| ~ leq(X7,n4)
| ~ leq(n0,X7) )
| ~ leq(X6,n135299)
| ~ leq(n0,X6) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK31])],[f224,f225]) ).
fof(f227,plain,
! [X0,X1] :
( X0 = X1
| gt(X1,X0)
| gt(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f228,plain,
! [X2,X0,X1] :
( gt(X0,X2)
| ~ gt(X1,X2)
| ~ gt(X0,X1) ),
inference(cnf_transformation,[],[f117]) ).
fof(f229,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f231,plain,
! [X2,X0,X1] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f233,plain,
! [X0,X1] :
( gt(X1,X0)
| X0 = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f122]) ).
fof(f343,plain,
leq(n0,sK31),
inference(cnf_transformation,[],[f226]) ).
fof(f344,plain,
leq(sK31,tptp_minus_1),
inference(cnf_transformation,[],[f226]) ).
fof(f352,plain,
gt(n0,tptp_minus_1),
inference(cnf_transformation,[],[f61]) ).
cnf(c_49,plain,
( X0 = X1
| gt(X0,X1)
| gt(X1,X0) ),
inference(cnf_transformation,[],[f227]) ).
cnf(c_50,plain,
( ~ gt(X0,X1)
| ~ gt(X1,X2)
| gt(X0,X2) ),
inference(cnf_transformation,[],[f228]) ).
cnf(c_51,plain,
~ gt(X0,X0),
inference(cnf_transformation,[],[f229]) ).
cnf(c_53,plain,
( ~ leq(X0,X1)
| ~ leq(X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f231]) ).
cnf(c_55,plain,
( ~ leq(X0,X1)
| X0 = X1
| gt(X1,X0) ),
inference(cnf_transformation,[],[f233]) ).
cnf(c_158,negated_conjecture,
leq(sK31,tptp_minus_1),
inference(cnf_transformation,[],[f344]) ).
cnf(c_159,negated_conjecture,
leq(n0,sK31),
inference(cnf_transformation,[],[f343]) ).
cnf(c_172,plain,
gt(n0,tptp_minus_1),
inference(cnf_transformation,[],[f352]) ).
cnf(c_206,plain,
~ gt(n0,n0),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_237,plain,
( n0 = n0
| gt(n0,n0) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_5937,negated_conjecture,
leq(n0,sK31),
inference(demodulation,[status(thm)],[c_159]) ).
cnf(c_5938,negated_conjecture,
leq(sK31,tptp_minus_1),
inference(demodulation,[status(thm)],[c_158]) ).
cnf(c_5943,plain,
( X0 != X1
| X2 != X3
| ~ gt(X1,X3)
| gt(X0,X2) ),
theory(equality) ).
cnf(c_10246,plain,
( ~ gt(tptp_minus_1,X0)
| ~ gt(n0,tptp_minus_1)
| gt(n0,X0) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_10247,plain,
( ~ gt(n0,tptp_minus_1)
| ~ gt(tptp_minus_1,n0)
| gt(n0,n0) ),
inference(instantiation,[status(thm)],[c_10246]) ).
cnf(c_10680,plain,
( X0 != n0
| X1 != tptp_minus_1
| ~ gt(n0,tptp_minus_1)
| gt(X0,X1) ),
inference(instantiation,[status(thm)],[c_5943]) ).
cnf(c_10681,plain,
( n0 != n0
| n0 != tptp_minus_1
| ~ gt(n0,tptp_minus_1)
| gt(n0,n0) ),
inference(instantiation,[status(thm)],[c_10680]) ).
cnf(c_11706,plain,
( ~ leq(X0,sK31)
| leq(X0,tptp_minus_1) ),
inference(superposition,[status(thm)],[c_5938,c_53]) ).
cnf(c_12017,plain,
leq(n0,tptp_minus_1),
inference(superposition,[status(thm)],[c_5937,c_11706]) ).
cnf(c_12348,plain,
( n0 = tptp_minus_1
| gt(tptp_minus_1,n0) ),
inference(superposition,[status(thm)],[c_12017,c_55]) ).
cnf(c_12418,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_12348,c_10681,c_10247,c_237,c_206,c_172]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWV188+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.06/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n023.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu Jun 20 15:01:24 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.90/1.13 % SZS status Started for theBenchmark.p
% 3.90/1.13 % SZS status Theorem for theBenchmark.p
% 3.90/1.13
% 3.90/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.90/1.13
% 3.90/1.13 ------ iProver source info
% 3.90/1.13
% 3.90/1.13 git: date: 2024-06-12 09:56:46 +0000
% 3.90/1.13 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 3.90/1.13 git: non_committed_changes: false
% 3.90/1.13
% 3.90/1.13 ------ Parsing...
% 3.90/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.90/1.13
% 3.90/1.13 ------ Preprocessing... sup_sim: 15 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.90/1.13
% 3.90/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.90/1.13
% 3.90/1.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.90/1.13 ------ Proving...
% 3.90/1.13 ------ Problem Properties
% 3.90/1.13
% 3.90/1.13
% 3.90/1.13 clauses 157
% 3.90/1.13 conjectures 9
% 3.90/1.13 EPR 46
% 3.90/1.13 Horn 107
% 3.90/1.13 unary 57
% 3.90/1.13 binary 34
% 3.90/1.13 lits 513
% 3.90/1.13 lits eq 121
% 3.90/1.13 fd_pure 0
% 3.90/1.13 fd_pseudo 0
% 3.90/1.13 fd_cond 6
% 3.90/1.13 fd_pseudo_cond 4
% 3.90/1.13 AC symbols 0
% 3.90/1.13
% 3.90/1.13 ------ Schedule dynamic 5 is on
% 3.90/1.13
% 3.90/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.90/1.13
% 3.90/1.13
% 3.90/1.13 ------
% 3.90/1.13 Current options:
% 3.90/1.13 ------
% 3.90/1.13
% 3.90/1.13
% 3.90/1.13
% 3.90/1.13
% 3.90/1.13 ------ Proving...
% 3.90/1.13
% 3.90/1.13
% 3.90/1.13 % SZS status Theorem for theBenchmark.p
% 3.90/1.13
% 3.90/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.90/1.13
% 3.90/1.13
%------------------------------------------------------------------------------