TSTP Solution File: SWV161+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV161+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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 : Fri May 3 03:13:39 EDT 2024
% Result : Theorem 7.97s 1.68s
% Output : CNFRefutation 7.97s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( ( X0 != X1
& leq(X0,X1) )
=> gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_gt2) ).
fof(f10,axiom,
! [X0,X1] :
( leq(X0,pred(X1))
<=> gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_gt_pred) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox/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/sandbox/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_5845,plain,
a_select3(q,pv10,tptp_sum_index) = sP0_iProver_def,
definition ).
cnf(c_5846,plain,
sum(n0,n4,sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_5847,plain,
minus(pv10,n1) = sP2_iProver_def,
definition ).
cnf(c_5848,plain,
a_select3(q,sK31,tptp_sum_index) = sP3_iProver_def,
definition ).
cnf(c_5849,plain,
sum(n0,n4,sP3_iProver_def) = sP4_iProver_def,
definition ).
cnf(c_5850,negated_conjecture,
sP1_iProver_def = n1,
inference(demodulation,[status(thm)],[c_163,c_5845,c_5846]) ).
cnf(c_5853,negated_conjecture,
( ~ leq(X0,sP2_iProver_def)
| ~ leq(n0,X0)
| sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 ),
inference(demodulation,[status(thm)],[c_160,c_5847]) ).
cnf(c_5854,negated_conjecture,
leq(n0,sK31),
inference(demodulation,[status(thm)],[c_159]) ).
cnf(c_5855,negated_conjecture,
leq(sK31,pv10),
inference(demodulation,[status(thm)],[c_158]) ).
cnf(c_5856,negated_conjecture,
sP4_iProver_def != n1,
inference(demodulation,[status(thm)],[c_157,c_5848,c_5849]) ).
cnf(c_8796,plain,
sP1_iProver_def != sP4_iProver_def,
inference(light_normalisation,[status(thm)],[c_5856,c_5850]) ).
cnf(c_8797,plain,
( ~ leq(X0,sP2_iProver_def)
| ~ leq(n0,X0)
| sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = sP1_iProver_def ),
inference(light_normalisation,[status(thm)],[c_5853,c_5850]) ).
cnf(c_8801,plain,
( ~ leq(sK31,sP2_iProver_def)
| sum(n0,n4,a_select3(q,sK31,tptp_sum_index)) = sP1_iProver_def ),
inference(superposition,[status(thm)],[c_5854,c_8797]) ).
cnf(c_8804,plain,
( ~ leq(sK31,sP2_iProver_def)
| sP1_iProver_def = sP4_iProver_def ),
inference(light_normalisation,[status(thm)],[c_8801,c_5848,c_5849]) ).
cnf(c_8805,plain,
~ leq(sK31,sP2_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_8804,c_8796]) ).
cnf(c_8828,plain,
minus(pv10,sP1_iProver_def) = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_5847,c_5850]) ).
cnf(c_9149,plain,
( ~ gt(X0,X1)
| leq(X1,minus(X0,sP1_iProver_def)) ),
inference(light_normalisation,[status(thm)],[c_56,c_5850]) ).
cnf(c_9154,plain,
( ~ gt(pv10,X0)
| leq(X0,sP2_iProver_def) ),
inference(superposition,[status(thm)],[c_8828,c_9149]) ).
cnf(c_11632,plain,
( sK31 = pv10
| gt(pv10,sK31) ),
inference(superposition,[status(thm)],[c_5855,c_55]) ).
cnf(c_12374,plain,
( sK31 = pv10
| leq(sK31,sP2_iProver_def) ),
inference(superposition,[status(thm)],[c_11632,c_9154]) ).
cnf(c_12375,plain,
sK31 = pv10,
inference(forward_subsumption_resolution,[status(thm)],[c_12374,c_8805]) ).
cnf(c_12380,plain,
a_select3(q,pv10,tptp_sum_index) = sP3_iProver_def,
inference(demodulation,[status(thm)],[c_5848,c_12375]) ).
cnf(c_12384,plain,
sP0_iProver_def = sP3_iProver_def,
inference(light_normalisation,[status(thm)],[c_12380,c_5845]) ).
cnf(c_12385,plain,
sum(n0,n4,sP0_iProver_def) = sP4_iProver_def,
inference(demodulation,[status(thm)],[c_5849,c_12384]) ).
cnf(c_12386,plain,
sP1_iProver_def = sP4_iProver_def,
inference(light_normalisation,[status(thm)],[c_12385,c_5846]) ).
cnf(c_12387,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12386,c_8796]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV161+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 01:09:15 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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
% 7.97/1.68 % SZS status Started for theBenchmark.p
% 7.97/1.68 % SZS status Theorem for theBenchmark.p
% 7.97/1.68
% 7.97/1.68 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.97/1.68
% 7.97/1.68 ------ iProver source info
% 7.97/1.68
% 7.97/1.68 git: date: 2024-05-02 19:28:25 +0000
% 7.97/1.68 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.97/1.68 git: non_committed_changes: false
% 7.97/1.68
% 7.97/1.68 ------ Parsing...
% 7.97/1.68 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.97/1.68
% 7.97/1.68 ------ Preprocessing... sup_sim: 16 sf_s rm: 1 0s sf_e pe_s pe_e
% 7.97/1.68
% 7.97/1.68 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.97/1.68
% 7.97/1.68 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.97/1.68 ------ Proving...
% 7.97/1.68 ------ Problem Properties
% 7.97/1.68
% 7.97/1.68
% 7.97/1.68 clauses 159
% 7.97/1.68 conjectures 7
% 7.97/1.68 EPR 49
% 7.97/1.68 Horn 109
% 7.97/1.68 unary 64
% 7.97/1.68 binary 34
% 7.97/1.68 lits 500
% 7.97/1.68 lits eq 121
% 7.97/1.68 fd_pure 0
% 7.97/1.68 fd_pseudo 0
% 7.97/1.68 fd_cond 6
% 7.97/1.68 fd_pseudo_cond 4
% 7.97/1.68 AC symbols 0
% 7.97/1.68
% 7.97/1.68 ------ Schedule dynamic 5 is on
% 7.97/1.68
% 7.97/1.68 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.97/1.68
% 7.97/1.68
% 7.97/1.68 ------
% 7.97/1.68 Current options:
% 7.97/1.68 ------
% 7.97/1.68
% 7.97/1.68
% 7.97/1.68
% 7.97/1.68
% 7.97/1.68 ------ Proving...
% 7.97/1.68
% 7.97/1.68
% 7.97/1.68 % SZS status Theorem for theBenchmark.p
% 7.97/1.68
% 7.97/1.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.97/1.68
% 7.97/1.69
%------------------------------------------------------------------------------