TSTP Solution File: SWV155+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV155+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:22 EDT 2023
% Result : Theorem 3.11s 1.17s
% Output : CNFRefutation 3.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 134 ( 47 equ)
% Maximal formula atoms : 15 ( 6 avg)
% Number of connectives : 154 ( 42 ~; 23 |; 73 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 12 con; 0-3 aty)
% Number of variables : 26 ( 0 sgn; 21 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pred_minus_1) ).
fof(f53,conjecture,
( ( ! [X17] :
( ( leq(X17,pred(pv10))
& leq(n0,X17) )
=> n1 = sum(n0,n4,a_select3(q,X17,tptp_sum_index)) )
& ! [X13] :
( ( leq(X13,pred(pv12))
& leq(n0,X13) )
=> a_select3(q,pv10,X13) = divide(sqrt(times(minus(a_select3(center,X13,n0),a_select2(x,pv10)),minus(a_select3(center,X13,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(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& pv70 = 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))))) )
=> ! [X3] :
( ( leq(X3,pred(pv10))
& leq(n0,X3) )
=> ( pv10 != X3
=> n1 = sum(n0,n4,a_select3(q,X3,tptp_sum_index)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0005) ).
fof(f54,negated_conjecture,
~ ( ( ! [X17] :
( ( leq(X17,pred(pv10))
& leq(n0,X17) )
=> n1 = sum(n0,n4,a_select3(q,X17,tptp_sum_index)) )
& ! [X13] :
( ( leq(X13,pred(pv12))
& leq(n0,X13) )
=> a_select3(q,pv10,X13) = divide(sqrt(times(minus(a_select3(center,X13,n0),a_select2(x,pv10)),minus(a_select3(center,X13,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(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& pv70 = 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))))) )
=> ! [X3] :
( ( leq(X3,pred(pv10))
& leq(n0,X3) )
=> ( pv10 != X3
=> n1 = sum(n0,n4,a_select3(q,X3,tptp_sum_index)) ) ) ),
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)) )
& ! [X1] :
( ( leq(X1,pred(pv12))
& 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)))))) )
& leq(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& pv70 = 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))))) )
=> ! [X2] :
( ( leq(X2,pred(pv10))
& leq(n0,X2) )
=> ( pv10 != X2
=> n1 = sum(n0,n4,a_select3(q,X2,tptp_sum_index)) ) ) ),
inference(rectify,[],[f54]) ).
fof(f156,plain,
( ? [X2] :
( n1 != sum(n0,n4,a_select3(q,X2,tptp_sum_index))
& pv10 != X2
& leq(X2,pred(pv10))
& leq(n0,X2) )
& ! [X0] :
( n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index))
| ~ leq(X0,pred(pv10))
| ~ leq(n0,X0) )
& ! [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,pred(pv12))
| ~ leq(n0,X1) )
& leq(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& pv70 = 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(ennf_transformation,[],[f114]) ).
fof(f157,plain,
( ? [X2] :
( n1 != sum(n0,n4,a_select3(q,X2,tptp_sum_index))
& pv10 != X2
& leq(X2,pred(pv10))
& leq(n0,X2) )
& ! [X0] :
( n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index))
| ~ leq(X0,pred(pv10))
| ~ leq(n0,X0) )
& ! [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,pred(pv12))
| ~ leq(n0,X1) )
& leq(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& pv70 = 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(flattening,[],[f156]) ).
fof(f224,plain,
( ? [X0] :
( n1 != sum(n0,n4,a_select3(q,X0,tptp_sum_index))
& pv10 != X0
& leq(X0,pred(pv10))
& leq(n0,X0) )
& ! [X1] :
( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X1) )
& ! [X2] :
( a_select3(q,pv10,X2) = divide(sqrt(times(minus(a_select3(center,X2,n0),a_select2(x,pv10)),minus(a_select3(center,X2,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(X2,pred(pv12))
| ~ leq(n0,X2) )
& leq(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& pv70 = 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,[],[f157]) ).
fof(f225,plain,
( ? [X0] :
( n1 != sum(n0,n4,a_select3(q,X0,tptp_sum_index))
& pv10 != X0
& leq(X0,pred(pv10))
& leq(n0,X0) )
=> ( n1 != sum(n0,n4,a_select3(q,sK31,tptp_sum_index))
& pv10 != sK31
& leq(sK31,pred(pv10))
& leq(n0,sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f226,plain,
( n1 != sum(n0,n4,a_select3(q,sK31,tptp_sum_index))
& pv10 != sK31
& leq(sK31,pred(pv10))
& leq(n0,sK31)
& ! [X1] :
( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X1) )
& ! [X2] :
( a_select3(q,pv10,X2) = divide(sqrt(times(minus(a_select3(center,X2,n0),a_select2(x,pv10)),minus(a_select3(center,X2,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(X2,pred(pv12))
| ~ leq(n0,X2) )
& leq(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& pv70 = 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(skolemisation,[status(esa),new_symbols(skolem,[sK31])],[f224,f225]) ).
fof(f317,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f343,plain,
! [X1] :
( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X1) ),
inference(cnf_transformation,[],[f226]) ).
fof(f344,plain,
leq(n0,sK31),
inference(cnf_transformation,[],[f226]) ).
fof(f345,plain,
leq(sK31,pred(pv10)),
inference(cnf_transformation,[],[f226]) ).
fof(f347,plain,
n1 != sum(n0,n4,a_select3(q,sK31,tptp_sum_index)),
inference(cnf_transformation,[],[f226]) ).
fof(f408,plain,
leq(sK31,minus(pv10,n1)),
inference(definition_unfolding,[],[f345,f317]) ).
fof(f409,plain,
! [X1] :
( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
| ~ leq(X1,minus(pv10,n1))
| ~ leq(n0,X1) ),
inference(definition_unfolding,[],[f343,f317]) ).
cnf(c_157,negated_conjecture,
sum(n0,n4,a_select3(q,sK31,tptp_sum_index)) != n1,
inference(cnf_transformation,[],[f347]) ).
cnf(c_159,negated_conjecture,
leq(sK31,minus(pv10,n1)),
inference(cnf_transformation,[],[f408]) ).
cnf(c_160,negated_conjecture,
leq(n0,sK31),
inference(cnf_transformation,[],[f344]) ).
cnf(c_161,negated_conjecture,
( ~ leq(X0,minus(pv10,n1))
| ~ leq(n0,X0)
| sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 ),
inference(cnf_transformation,[],[f409]) ).
cnf(c_8876,plain,
( ~ leq(n0,sK31)
| sum(n0,n4,a_select3(q,sK31,tptp_sum_index)) = n1 ),
inference(superposition,[status(thm)],[c_159,c_161]) ).
cnf(c_8877,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_8876,c_157,c_160]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV155+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 09:33:14 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.11/1.17 % SZS status Started for theBenchmark.p
% 3.11/1.17 % SZS status Theorem for theBenchmark.p
% 3.11/1.17
% 3.11/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.11/1.17
% 3.11/1.17 ------ iProver source info
% 3.11/1.17
% 3.11/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.11/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.11/1.17 git: non_committed_changes: false
% 3.11/1.17 git: last_make_outside_of_git: false
% 3.11/1.17
% 3.11/1.17 ------ Parsing...
% 3.11/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.11/1.17
% 3.11/1.17 ------ Preprocessing... sup_sim: 17 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.11/1.17
% 3.11/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.11/1.17
% 3.11/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.11/1.17 ------ Proving...
% 3.11/1.17 ------ Problem Properties
% 3.11/1.17
% 3.11/1.17
% 3.11/1.17 clauses 158
% 3.11/1.17 conjectures 10
% 3.11/1.17 EPR 49
% 3.11/1.17 Horn 108
% 3.11/1.17 unary 62
% 3.11/1.17 binary 34
% 3.11/1.17 lits 501
% 3.11/1.17 lits eq 118
% 3.11/1.17 fd_pure 0
% 3.11/1.17 fd_pseudo 0
% 3.11/1.17 fd_cond 6
% 3.11/1.17 fd_pseudo_cond 4
% 3.11/1.17 AC symbols 0
% 3.11/1.17
% 3.11/1.17 ------ Schedule dynamic 5 is on
% 3.11/1.17
% 3.11/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.11/1.17
% 3.11/1.17
% 3.11/1.17 ------
% 3.11/1.17 Current options:
% 3.11/1.17 ------
% 3.11/1.17
% 3.11/1.17
% 3.11/1.17
% 3.11/1.17
% 3.11/1.17 ------ Proving...
% 3.11/1.17
% 3.11/1.17
% 3.11/1.17 % SZS status Theorem for theBenchmark.p
% 3.11/1.17
% 3.11/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.11/1.17
% 3.11/1.18
%------------------------------------------------------------------------------