TSTP Solution File: SWV163+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV163+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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 : Thu Aug 31 22:31:24 EDT 2023
% Result : Theorem 0.81s 1.14s
% Output : CNFRefutation 0.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 22 unt; 0 def)
% Number of atoms : 115 ( 27 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 110 ( 37 ~; 23 |; 38 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 11 con; 0-3 aty)
% Number of variables : 51 ( 0 sgn; 37 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
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(f13,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> gt(succ(X1),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).
fof(f28,axiom,
n0 = succ(tptp_minus_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_tptp_minus_1) ).
fof(f29,axiom,
! [X0] : succ(X0) = plus(X0,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_plus_1_r) ).
fof(f30,axiom,
! [X0] : succ(X0) = plus(n1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_plus_1_l) ).
fof(f53,conjecture,
( ( ! [X13] :
( ( leq(X13,pred(pv10))
& leq(n0,X13) )
=> n1 = sum(n0,n4,a_select3(q,X13,tptp_sum_index)) )
& leq(pv10,n135299)
& leq(n0,pv10) )
=> ! [X17] :
( ( leq(X17,tptp_minus_1)
& leq(n0,X17) )
=> a_select3(q,pv10,X17) = divide(sqrt(times(minus(a_select3(center,X17,n0),a_select2(x,pv10)),minus(a_select3(center,X17,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0013) ).
fof(f54,negated_conjecture,
~ ( ( ! [X13] :
( ( leq(X13,pred(pv10))
& leq(n0,X13) )
=> n1 = sum(n0,n4,a_select3(q,X13,tptp_sum_index)) )
& leq(pv10,n135299)
& leq(n0,pv10) )
=> ! [X17] :
( ( leq(X17,tptp_minus_1)
& leq(n0,X17) )
=> a_select3(q,pv10,X17) = divide(sqrt(times(minus(a_select3(center,X17,n0),a_select2(x,pv10)),minus(a_select3(center,X17,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f114,plain,
~ ( ( ! [X0] :
( ( leq(X0,pred(pv10))
& leq(n0,X0) )
=> n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index)) )
& leq(pv10,n135299)
& leq(n0,pv10) )
=> ! [X1] :
( ( leq(X1,tptp_minus_1)
& leq(n0,X1) )
=> a_select3(q,pv10,X1) = divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ),
inference(rectify,[],[f54]) ).
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(f156,plain,
( ? [X1] :
( a_select3(q,pv10,X1) != divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
& leq(X1,tptp_minus_1)
& leq(n0,X1) )
& ! [X0] :
( n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index))
| ~ leq(X0,pred(pv10))
| ~ leq(n0,X0) )
& leq(pv10,n135299)
& leq(n0,pv10) ),
inference(ennf_transformation,[],[f114]) ).
fof(f157,plain,
( ? [X1] :
( a_select3(q,pv10,X1) != divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
& leq(X1,tptp_minus_1)
& leq(n0,X1) )
& ! [X0] :
( n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index))
| ~ leq(X0,pred(pv10))
| ~ leq(n0,X0) )
& leq(pv10,n135299)
& leq(n0,pv10) ),
inference(flattening,[],[f156]) ).
fof(f178,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ~ gt(succ(X1),X0) )
& ( gt(succ(X1),X0)
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f224,plain,
( ? [X0] :
( a_select3(q,pv10,X0) != divide(sqrt(times(minus(a_select3(center,X0,n0),a_select2(x,pv10)),minus(a_select3(center,X0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
& leq(X0,tptp_minus_1)
& leq(n0,X0) )
& ! [X1] :
( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X1) )
& leq(pv10,n135299)
& leq(n0,pv10) ),
inference(rectify,[],[f157]) ).
fof(f225,plain,
( ? [X0] :
( a_select3(q,pv10,X0) != divide(sqrt(times(minus(a_select3(center,X0,n0),a_select2(x,pv10)),minus(a_select3(center,X0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
& leq(X0,tptp_minus_1)
& leq(n0,X0) )
=> ( a_select3(q,pv10,sK31) != divide(sqrt(times(minus(a_select3(center,sK31,n0),a_select2(x,pv10)),minus(a_select3(center,sK31,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
& leq(sK31,tptp_minus_1)
& leq(n0,sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f226,plain,
( a_select3(q,pv10,sK31) != divide(sqrt(times(minus(a_select3(center,sK31,n0),a_select2(x,pv10)),minus(a_select3(center,sK31,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
& leq(sK31,tptp_minus_1)
& leq(n0,sK31)
& ! [X1] :
( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X1) )
& leq(pv10,n135299)
& leq(n0,pv10) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK31])],[f224,f225]) ).
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(f238,plain,
! [X0,X1] :
( gt(succ(X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f178]) ).
fof(f306,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f307,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f308,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f340,plain,
leq(n0,sK31),
inference(cnf_transformation,[],[f226]) ).
fof(f341,plain,
leq(sK31,tptp_minus_1),
inference(cnf_transformation,[],[f226]) ).
fof(f387,plain,
! [X0,X1] :
( gt(plus(X1,n1),X0)
| ~ leq(X0,X1) ),
inference(definition_unfolding,[],[f238,f307]) ).
fof(f388,plain,
n0 = plus(tptp_minus_1,n1),
inference(definition_unfolding,[],[f306,f307]) ).
fof(f389,plain,
! [X0] : plus(X0,n1) = plus(n1,X0),
inference(definition_unfolding,[],[f308,f307]) ).
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_61,plain,
( ~ leq(X0,X1)
| gt(plus(X1,n1),X0) ),
inference(cnf_transformation,[],[f387]) ).
cnf(c_128,plain,
plus(tptp_minus_1,n1) = n0,
inference(cnf_transformation,[],[f388]) ).
cnf(c_129,plain,
plus(X0,n1) = plus(n1,X0),
inference(cnf_transformation,[],[f389]) ).
cnf(c_158,negated_conjecture,
leq(sK31,tptp_minus_1),
inference(cnf_transformation,[],[f341]) ).
cnf(c_159,negated_conjecture,
leq(n0,sK31),
inference(cnf_transformation,[],[f340]) ).
cnf(c_1635,plain,
plus(n1,tptp_minus_1) = n0,
inference(demodulation,[status(thm)],[c_128,c_129]) ).
cnf(c_9037,plain,
~ leq(plus(X0,n1),X0),
inference(superposition,[status(thm)],[c_61,c_51]) ).
cnf(c_9175,plain,
~ leq(plus(n1,X0),X0),
inference(superposition,[status(thm)],[c_129,c_9037]) ).
cnf(c_9263,plain,
~ leq(n0,tptp_minus_1),
inference(superposition,[status(thm)],[c_1635,c_9175]) ).
cnf(c_10080,plain,
( ~ leq(X0,sK31)
| leq(X0,tptp_minus_1) ),
inference(superposition,[status(thm)],[c_158,c_53]) ).
cnf(c_10243,plain,
( ~ leq(n0,sK31)
| leq(n0,tptp_minus_1) ),
inference(instantiation,[status(thm)],[c_10080]) ).
cnf(c_10244,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_10243,c_9263,c_159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV163+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 03:33:51 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.81/1.14 % SZS status Started for theBenchmark.p
% 0.81/1.14 % SZS status Theorem for theBenchmark.p
% 0.81/1.14
% 0.81/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.81/1.14
% 0.81/1.14 ------ iProver source info
% 0.81/1.14
% 0.81/1.14 git: date: 2023-05-31 18:12:56 +0000
% 0.81/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.81/1.14 git: non_committed_changes: false
% 0.81/1.14 git: last_make_outside_of_git: false
% 0.81/1.14
% 0.81/1.14 ------ Parsing...
% 0.81/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.81/1.14
% 0.81/1.14 ------ Preprocessing... sup_sim: 16 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.81/1.14
% 0.81/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.81/1.14
% 0.81/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.81/1.14 ------ Proving...
% 0.81/1.14 ------ Problem Properties
% 0.81/1.14
% 0.81/1.14
% 0.81/1.14 clauses 153
% 0.81/1.14 conjectures 6
% 0.81/1.14 EPR 47
% 0.81/1.14 Horn 103
% 0.81/1.14 unary 58
% 0.81/1.14 binary 34
% 0.81/1.14 lits 494
% 0.81/1.14 lits eq 115
% 0.81/1.14 fd_pure 0
% 0.81/1.14 fd_pseudo 0
% 0.81/1.14 fd_cond 6
% 0.81/1.14 fd_pseudo_cond 4
% 0.81/1.14 AC symbols 0
% 0.81/1.14
% 0.81/1.14 ------ Schedule dynamic 5 is on
% 0.81/1.14
% 0.81/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.81/1.14
% 0.81/1.14
% 0.81/1.14 ------
% 0.81/1.14 Current options:
% 0.81/1.14 ------
% 0.81/1.14
% 0.81/1.14
% 0.81/1.14
% 0.81/1.14
% 0.81/1.14 ------ Proving...
% 0.81/1.14
% 0.81/1.14
% 0.81/1.14 % SZS status Theorem for theBenchmark.p
% 0.81/1.14
% 0.81/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.81/1.14
% 0.81/1.15
%------------------------------------------------------------------------------