TSTP Solution File: SWV161+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV161+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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 2.22s 1.16s
% Output : CNFRefutation 2.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 13 unt; 0 def)
% Number of atoms : 126 ( 43 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 127 ( 38 ~; 32 |; 45 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-3 aty)
% Number of variables : 40 ( 0 sgn; 30 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( ( X0 != X1
& leq(X0,X1) )
=> gt(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_gt2) ).
fof(f10,axiom,
! [X0,X1] :
( leq(X0,pred(X1))
<=> gt(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_gt_pred) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_minus_1) ).
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)
& n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) )
=> ! [X17] :
( ( leq(X17,pv10)
& leq(n0,X17) )
=> n1 = sum(n0,n4,a_select3(q,X17,tptp_sum_index)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0011) ).
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)
& n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) )
=> ! [X17] :
( ( leq(X17,pv10)
& leq(n0,X17) )
=> n1 = sum(n0,n4,a_select3(q,X17,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)) )
& leq(pv10,n135299)
& leq(n0,pv10)
& n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) )
=> ! [X1] :
( ( leq(X1,pv10)
& leq(n0,X1) )
=> n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index)) ) ),
inference(rectify,[],[f54]) ).
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,
( ? [X1] :
( n1 != sum(n0,n4,a_select3(q,X1,tptp_sum_index))
& leq(X1,pv10)
& 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)
& n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) ),
inference(ennf_transformation,[],[f114]) ).
fof(f157,plain,
( ? [X1] :
( n1 != sum(n0,n4,a_select3(q,X1,tptp_sum_index))
& leq(X1,pv10)
& 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)
& n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) ),
inference(flattening,[],[f156]) ).
fof(f177,plain,
! [X0,X1] :
( ( leq(X0,pred(X1))
| ~ gt(X1,X0) )
& ( gt(X1,X0)
| ~ leq(X0,pred(X1)) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f224,plain,
( ? [X0] :
( n1 != sum(n0,n4,a_select3(q,X0,tptp_sum_index))
& leq(X0,pv10)
& 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)
& n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) ),
inference(rectify,[],[f157]) ).
fof(f225,plain,
( ? [X0] :
( n1 != sum(n0,n4,a_select3(q,X0,tptp_sum_index))
& leq(X0,pv10)
& leq(n0,X0) )
=> ( n1 != sum(n0,n4,a_select3(q,sK31,tptp_sum_index))
& leq(sK31,pv10)
& leq(n0,sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f226,plain,
( n1 != sum(n0,n4,a_select3(q,sK31,tptp_sum_index))
& leq(sK31,pv10)
& 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)
& n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK31])],[f224,f225]) ).
fof(f233,plain,
! [X0,X1] :
( gt(X1,X0)
| X0 = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f122]) ).
fof(f235,plain,
! [X0,X1] :
( leq(X0,pred(X1))
| ~ gt(X1,X0) ),
inference(cnf_transformation,[],[f177]) ).
fof(f317,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f337,plain,
n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)),
inference(cnf_transformation,[],[f226]) ).
fof(f340,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(f341,plain,
leq(n0,sK31),
inference(cnf_transformation,[],[f226]) ).
fof(f342,plain,
leq(sK31,pv10),
inference(cnf_transformation,[],[f226]) ).
fof(f343,plain,
n1 != sum(n0,n4,a_select3(q,sK31,tptp_sum_index)),
inference(cnf_transformation,[],[f226]) ).
fof(f383,plain,
! [X0,X1] :
( leq(X0,minus(X1,n1))
| ~ gt(X1,X0) ),
inference(definition_unfolding,[],[f235,f317]) ).
fof(f404,plain,
! [X1] :
( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
| ~ leq(X1,minus(pv10,n1))
| ~ leq(n0,X1) ),
inference(definition_unfolding,[],[f340,f317]) ).
cnf(c_55,plain,
( ~ leq(X0,X1)
| X0 = X1
| gt(X1,X0) ),
inference(cnf_transformation,[],[f233]) ).
cnf(c_56,plain,
( ~ gt(X0,X1)
| leq(X1,minus(X0,n1)) ),
inference(cnf_transformation,[],[f383]) ).
cnf(c_157,negated_conjecture,
sum(n0,n4,a_select3(q,sK31,tptp_sum_index)) != n1,
inference(cnf_transformation,[],[f343]) ).
cnf(c_158,negated_conjecture,
leq(sK31,pv10),
inference(cnf_transformation,[],[f342]) ).
cnf(c_159,negated_conjecture,
leq(n0,sK31),
inference(cnf_transformation,[],[f341]) ).
cnf(c_160,negated_conjecture,
( ~ leq(X0,minus(pv10,n1))
| ~ leq(n0,X0)
| sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 ),
inference(cnf_transformation,[],[f404]) ).
cnf(c_163,negated_conjecture,
sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1,
inference(cnf_transformation,[],[f337]) ).
cnf(c_8851,plain,
( ~ gt(pv10,X0)
| ~ leq(n0,X0)
| sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 ),
inference(superposition,[status(thm)],[c_56,c_160]) ).
cnf(c_10559,plain,
( sK31 = pv10
| gt(pv10,sK31) ),
inference(superposition,[status(thm)],[c_158,c_55]) ).
cnf(c_10941,plain,
( ~ leq(n0,sK31)
| sum(n0,n4,a_select3(q,sK31,tptp_sum_index)) = n1
| sK31 = pv10 ),
inference(superposition,[status(thm)],[c_10559,c_8851]) ).
cnf(c_10945,plain,
sK31 = pv10,
inference(forward_subsumption_resolution,[status(thm)],[c_10941,c_157,c_159]) ).
cnf(c_10951,plain,
sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) != n1,
inference(demodulation,[status(thm)],[c_157,c_10945]) ).
cnf(c_10954,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10951,c_163]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV161+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n028.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 10:56:26 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.22/1.16 % SZS status Started for theBenchmark.p
% 2.22/1.16 % SZS status Theorem for theBenchmark.p
% 2.22/1.16
% 2.22/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.22/1.16
% 2.22/1.16 ------ iProver source info
% 2.22/1.16
% 2.22/1.16 git: date: 2023-05-31 18:12:56 +0000
% 2.22/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.22/1.16 git: non_committed_changes: false
% 2.22/1.16 git: last_make_outside_of_git: false
% 2.22/1.16
% 2.22/1.16 ------ Parsing...
% 2.22/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.22/1.16
% 2.22/1.16 ------ Preprocessing... sup_sim: 16 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.22/1.16
% 2.22/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.22/1.16
% 2.22/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.22/1.16 ------ Proving...
% 2.22/1.16 ------ Problem Properties
% 2.22/1.16
% 2.22/1.16
% 2.22/1.16 clauses 154
% 2.22/1.16 conjectures 7
% 2.22/1.16 EPR 47
% 2.22/1.16 Horn 104
% 2.22/1.16 unary 59
% 2.22/1.16 binary 34
% 2.22/1.16 lits 495
% 2.22/1.16 lits eq 116
% 2.22/1.16 fd_pure 0
% 2.22/1.16 fd_pseudo 0
% 2.22/1.16 fd_cond 6
% 2.22/1.16 fd_pseudo_cond 4
% 2.22/1.16 AC symbols 0
% 2.22/1.16
% 2.22/1.16 ------ Schedule dynamic 5 is on
% 2.22/1.16
% 2.22/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.22/1.16
% 2.22/1.16
% 2.22/1.16 ------
% 2.22/1.16 Current options:
% 2.22/1.16 ------
% 2.22/1.16
% 2.22/1.16
% 2.22/1.16
% 2.22/1.16
% 2.22/1.16 ------ Proving...
% 2.22/1.16
% 2.22/1.16
% 2.22/1.16 % SZS status Theorem for theBenchmark.p
% 2.22/1.16
% 2.22/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.22/1.16
% 2.22/1.16
%------------------------------------------------------------------------------