TSTP Solution File: SWV033+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV033+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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 : 600s
% DateTime : Wed Jul 20 18:14:53 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 25
% Syntax : Number of formulae : 190 ( 61 unt; 0 def)
% Number of atoms : 524 ( 245 equ)
% Maximal formula atoms : 56 ( 2 avg)
% Number of connectives : 464 ( 130 ~; 257 |; 52 &)
% ( 3 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-3 aty)
% Number of variables : 164 ( 9 sgn 91 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(gauss_init_0045,conjecture,
( ( init = init
& leq(n0,pv1376)
& leq(pv1376,n3)
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,n2) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,n3) )
=> a_select3(simplex7_init,X18,X14) = init ) )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,minus(pv1376,n1)) )
=> a_select2(s_values7_init,X4) = init ) )
=> ( init = init
& ! [X20] :
( ( leq(n0,X20)
& leq(X20,n2) )
=> ! [X21] :
( ( leq(n0,X21)
& leq(X21,n3) )
=> a_select3(simplex7_init,X21,X20) = init ) )
& ! [X22] :
( ( leq(n0,X22)
& leq(X22,minus(plus(n1,pv1376),n1)) )
=> a_select2(tptp_update2(s_values7_init,pv1376,init),X22) = init ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gauss_init_0045) ).
fof(succ_plus_1_l,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_l) ).
fof(succ_plus_1_r,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(finite_domain_3,axiom,
! [X1] :
( ( leq(n0,X1)
& leq(X1,n3) )
=> ( X1 = n0
| X1 = n1
| X1 = n2
| X1 = n3 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',finite_domain_3) ).
fof(leq_gt_pred,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).
fof(leq_succ_gt_equiv,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).
fof(gt_1_0,axiom,
gt(n1,n0),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_1_0) ).
fof(finite_domain_1,axiom,
! [X1] :
( ( leq(n0,X1)
& leq(X1,n1) )
=> ( X1 = n0
| X1 = n1 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',finite_domain_1) ).
fof(sel2_update_2,axiom,
! [X5,X7,X1,X17,X25] :
( ( X5 != X7
& a_select2(X1,X7) = X17 )
=> a_select2(tptp_update2(X1,X5,X25),X7) = X17 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sel2_update_2) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_1) ).
fof(reflexivity_leq,axiom,
! [X1] : leq(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
fof(transitivity_leq,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(transitivity_gt,axiom,
! [X1,X2,X3] :
( ( gt(X1,X2)
& gt(X2,X3) )
=> gt(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_gt) ).
fof(successor_2,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_2) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(gt_2_0,axiom,
gt(n2,n0),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_2_0) ).
fof(leq_succ_gt,axiom,
! [X1,X2] :
( leq(succ(X1),X2)
=> gt(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_gt) ).
fof(successor_3,axiom,
succ(succ(succ(n0))) = n3,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_3) ).
fof(leq_gt1,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(leq_succ_succ,axiom,
! [X1,X2] :
( leq(succ(X1),succ(X2))
<=> leq(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_succ) ).
fof(succ_pred,axiom,
! [X1] : succ(pred(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_pred) ).
fof(leq_gt2,axiom,
! [X1,X2] :
( ( leq(X1,X2)
& X1 != X2 )
=> gt(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt2) ).
fof(sel2_update_1,axiom,
! [X1,X7,X17] : a_select2(tptp_update2(X1,X7,X17),X7) = X17,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sel2_update_1) ).
fof(c_0_25,negated_conjecture,
~ ( ( init = init
& leq(n0,pv1376)
& leq(pv1376,n3)
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,n2) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,n3) )
=> a_select3(simplex7_init,X18,X14) = init ) )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,minus(pv1376,n1)) )
=> a_select2(s_values7_init,X4) = init ) )
=> ( init = init
& ! [X20] :
( ( leq(n0,X20)
& leq(X20,n2) )
=> ! [X21] :
( ( leq(n0,X21)
& leq(X21,n3) )
=> a_select3(simplex7_init,X21,X20) = init ) )
& ! [X22] :
( ( leq(n0,X22)
& leq(X22,minus(plus(n1,pv1376),n1)) )
=> a_select2(tptp_update2(s_values7_init,pv1376,init),X22) = init ) ) ),
inference(assume_negation,[status(cth)],[gauss_init_0045]) ).
fof(c_0_26,negated_conjecture,
! [X23,X24,X25] :
( init = init
& leq(n0,pv1376)
& leq(pv1376,n3)
& ( ~ leq(n0,X23)
| ~ leq(X23,n2)
| ~ leq(n0,X24)
| ~ leq(X24,n3)
| a_select3(simplex7_init,X24,X23) = init )
& ( ~ leq(n0,X25)
| ~ leq(X25,minus(pv1376,n1))
| a_select2(s_values7_init,X25) = init )
& ( leq(n0,esk3_0)
| leq(n0,esk1_0)
| init != init )
& ( leq(esk3_0,minus(plus(n1,pv1376),n1))
| leq(n0,esk1_0)
| init != init )
& ( a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init
| leq(n0,esk1_0)
| init != init )
& ( leq(n0,esk3_0)
| leq(esk1_0,n2)
| init != init )
& ( leq(esk3_0,minus(plus(n1,pv1376),n1))
| leq(esk1_0,n2)
| init != init )
& ( a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init
| leq(esk1_0,n2)
| init != init )
& ( leq(n0,esk3_0)
| leq(n0,esk2_0)
| init != init )
& ( leq(esk3_0,minus(plus(n1,pv1376),n1))
| leq(n0,esk2_0)
| init != init )
& ( a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init
| leq(n0,esk2_0)
| init != init )
& ( leq(n0,esk3_0)
| leq(esk2_0,n3)
| init != init )
& ( leq(esk3_0,minus(plus(n1,pv1376),n1))
| leq(esk2_0,n3)
| init != init )
& ( a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init
| leq(esk2_0,n3)
| init != init )
& ( leq(n0,esk3_0)
| a_select3(simplex7_init,esk2_0,esk1_0) != init
| init != init )
& ( leq(esk3_0,minus(plus(n1,pv1376),n1))
| a_select3(simplex7_init,esk2_0,esk1_0) != init
| init != init )
& ( a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init
| a_select3(simplex7_init,esk2_0,esk1_0) != init
| init != init ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])])])])]) ).
fof(c_0_27,plain,
! [X2] : plus(n1,X2) = succ(X2),
inference(variable_rename,[status(thm)],[succ_plus_1_l]) ).
fof(c_0_28,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).
fof(c_0_29,plain,
! [X2] : pred(succ(X2)) = X2,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_30,plain,
! [X2] : minus(X2,n1) = pred(X2),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
fof(c_0_31,plain,
! [X2] :
( ~ leq(n0,X2)
| ~ leq(X2,n3)
| X2 = n0
| X2 = n1
| X2 = n2
| X2 = n3 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_3])]) ).
cnf(c_0_32,negated_conjecture,
( leq(esk3_0,minus(plus(n1,pv1376),n1))
| $false
| a_select3(simplex7_init,esk2_0,esk1_0) != init ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_37,plain,
! [X3,X4,X3,X4] :
( ( ~ leq(X3,pred(X4))
| gt(X4,X3) )
& ( ~ gt(X4,X3)
| leq(X3,pred(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])])]) ).
cnf(c_0_38,plain,
( X1 = n3
| X1 = n2
| X1 = n1
| X1 = n0
| ~ leq(X1,n3)
| ~ leq(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,negated_conjecture,
leq(pv1376,n3),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_40,negated_conjecture,
leq(n0,pv1376),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_41,negated_conjecture,
( leq(esk3_0,minus(plus(n1,pv1376),n1))
| a_select3(simplex7_init,esk2_0,esk1_0) != init ),
inference(cn,[status(thm)],[c_0_32]) ).
cnf(c_0_42,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_43,plain,
minus(plus(X1,n1),n1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_34]),c_0_36]) ).
cnf(c_0_44,negated_conjecture,
( leq(n0,esk2_0)
| leq(esk3_0,minus(plus(n1,pv1376),n1))
| $false ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_45,negated_conjecture,
( leq(n0,esk1_0)
| leq(esk3_0,minus(plus(n1,pv1376),n1))
| $false ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_46,negated_conjecture,
( leq(esk2_0,n3)
| leq(esk3_0,minus(plus(n1,pv1376),n1))
| $false ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_47,negated_conjecture,
( leq(esk1_0,n2)
| leq(esk3_0,minus(plus(n1,pv1376),n1))
| $false ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_48,plain,
! [X3,X4,X3,X4] :
( ( ~ leq(X3,X4)
| gt(succ(X4),X3) )
& ( ~ gt(succ(X4),X3)
| leq(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt_equiv])])])]) ).
cnf(c_0_49,plain,
( leq(X1,pred(X2))
| ~ gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_50,plain,
gt(n1,n0),
inference(split_conjunct,[status(thm)],[gt_1_0]) ).
cnf(c_0_51,negated_conjecture,
( n0 = pv1376
| n1 = pv1376
| n2 = pv1376
| n3 = pv1376 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
fof(c_0_52,plain,
! [X2] :
( ~ leq(n0,X2)
| ~ leq(X2,n1)
| X2 = n0
| X2 = n1 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_1])]) ).
cnf(c_0_53,negated_conjecture,
( leq(esk3_0,pv1376)
| a_select3(simplex7_init,esk2_0,esk1_0) != init ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_54,negated_conjecture,
( a_select3(simplex7_init,X1,X2) = init
| ~ leq(X1,n3)
| ~ leq(n0,X1)
| ~ leq(X2,n2)
| ~ leq(n0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_55,negated_conjecture,
( leq(n0,esk2_0)
| leq(esk3_0,minus(plus(n1,pv1376),n1)) ),
inference(cn,[status(thm)],[c_0_44]) ).
cnf(c_0_56,negated_conjecture,
( leq(n0,esk1_0)
| leq(esk3_0,minus(plus(n1,pv1376),n1)) ),
inference(cn,[status(thm)],[c_0_45]) ).
cnf(c_0_57,negated_conjecture,
( leq(esk2_0,n3)
| leq(esk3_0,minus(plus(n1,pv1376),n1)) ),
inference(cn,[status(thm)],[c_0_46]) ).
cnf(c_0_58,negated_conjecture,
( leq(esk1_0,n2)
| leq(esk3_0,minus(plus(n1,pv1376),n1)) ),
inference(cn,[status(thm)],[c_0_47]) ).
cnf(c_0_59,negated_conjecture,
( leq(n0,esk3_0)
| $false
| a_select3(simplex7_init,esk2_0,esk1_0) != init ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_60,negated_conjecture,
( leq(n0,esk2_0)
| leq(n0,esk3_0)
| $false ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_61,negated_conjecture,
( leq(n0,esk1_0)
| leq(n0,esk3_0)
| $false ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_62,negated_conjecture,
( leq(esk2_0,n3)
| leq(n0,esk3_0)
| $false ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_63,negated_conjecture,
( leq(esk1_0,n2)
| leq(n0,esk3_0)
| $false ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_64,negated_conjecture,
( $false
| a_select3(simplex7_init,esk2_0,esk1_0) != init
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_65,negated_conjecture,
( leq(n0,esk2_0)
| $false
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_66,negated_conjecture,
( leq(n0,esk1_0)
| $false
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_67,negated_conjecture,
( leq(esk2_0,n3)
| $false
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_68,negated_conjecture,
( leq(esk1_0,n2)
| $false
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_69,plain,
! [X26,X27,X28,X29,X30] :
( X26 = X27
| a_select2(X28,X27) != X29
| a_select2(tptp_update2(X28,X26,X30),X27) = X29 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sel2_update_2])])])]) ).
cnf(c_0_70,plain,
( gt(succ(X1),X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_71,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_72,plain,
( leq(X1,minus(X2,n1))
| ~ gt(X2,X1) ),
inference(rw,[status(thm)],[c_0_49,c_0_36]) ).
cnf(c_0_73,negated_conjecture,
( n3 = pv1376
| n2 = pv1376
| n0 = pv1376
| gt(pv1376,n0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
fof(c_0_74,plain,
! [X2] : leq(X2,X2),
inference(variable_rename,[status(thm)],[reflexivity_leq]) ).
cnf(c_0_75,plain,
( X1 = n1
| X1 = n0
| ~ leq(X1,n1)
| ~ leq(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_76,negated_conjecture,
( leq(esk3_0,pv1376)
| ~ leq(esk1_0,n2)
| ~ leq(esk2_0,n3)
| ~ leq(n0,esk1_0)
| ~ leq(n0,esk2_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_77,negated_conjecture,
( leq(n0,esk2_0)
| leq(esk3_0,pv1376) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_42]),c_0_43]) ).
cnf(c_0_78,negated_conjecture,
( leq(n0,esk1_0)
| leq(esk3_0,pv1376) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_42]),c_0_43]) ).
cnf(c_0_79,negated_conjecture,
( leq(esk2_0,n3)
| leq(esk3_0,pv1376) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_42]),c_0_43]) ).
cnf(c_0_80,negated_conjecture,
( leq(esk1_0,n2)
| leq(esk3_0,pv1376) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_42]),c_0_43]) ).
cnf(c_0_81,negated_conjecture,
( leq(n0,esk3_0)
| a_select3(simplex7_init,esk2_0,esk1_0) != init ),
inference(cn,[status(thm)],[c_0_59]) ).
cnf(c_0_82,negated_conjecture,
( leq(n0,esk2_0)
| leq(n0,esk3_0) ),
inference(cn,[status(thm)],[c_0_60]) ).
cnf(c_0_83,negated_conjecture,
( leq(n0,esk1_0)
| leq(n0,esk3_0) ),
inference(cn,[status(thm)],[c_0_61]) ).
cnf(c_0_84,negated_conjecture,
( leq(n0,esk3_0)
| leq(esk2_0,n3) ),
inference(cn,[status(thm)],[c_0_62]) ).
cnf(c_0_85,negated_conjecture,
( leq(n0,esk3_0)
| leq(esk1_0,n2) ),
inference(cn,[status(thm)],[c_0_63]) ).
cnf(c_0_86,negated_conjecture,
( a_select3(simplex7_init,esk2_0,esk1_0) != init
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init ),
inference(cn,[status(thm)],[c_0_64]) ).
cnf(c_0_87,negated_conjecture,
( leq(n0,esk2_0)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init ),
inference(cn,[status(thm)],[c_0_65]) ).
cnf(c_0_88,negated_conjecture,
( leq(n0,esk1_0)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init ),
inference(cn,[status(thm)],[c_0_66]) ).
cnf(c_0_89,negated_conjecture,
( leq(esk2_0,n3)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init ),
inference(cn,[status(thm)],[c_0_67]) ).
cnf(c_0_90,negated_conjecture,
( leq(esk1_0,n2)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init ),
inference(cn,[status(thm)],[c_0_68]) ).
cnf(c_0_91,plain,
( a_select2(tptp_update2(X1,X2,X3),X4) = X5
| X2 = X4
| a_select2(X1,X4) != X5 ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
fof(c_0_92,plain,
! [X4,X5,X6] :
( ~ leq(X4,X5)
| ~ leq(X5,X6)
| leq(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])]) ).
fof(c_0_93,plain,
! [X4,X5,X6] :
( ~ gt(X4,X5)
| ~ gt(X5,X6)
| gt(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_gt])]) ).
cnf(c_0_94,plain,
succ(succ(n0)) = n2,
inference(split_conjunct,[status(thm)],[successor_2]) ).
fof(c_0_95,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[irreflexivity_gt])]) ).
cnf(c_0_96,plain,
( gt(plus(X1,n1),X2)
| ~ leq(X2,X1) ),
inference(rw,[status(thm)],[c_0_70,c_0_34]) ).
cnf(c_0_97,plain,
plus(n0,n1) = n1,
inference(rw,[status(thm)],[c_0_71,c_0_34]) ).
cnf(c_0_98,negated_conjecture,
( a_select2(s_values7_init,X1) = init
| ~ leq(X1,minus(pv1376,n1))
| ~ leq(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_99,negated_conjecture,
( n0 = pv1376
| n2 = pv1376
| n3 = pv1376
| leq(n0,minus(pv1376,n1)) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_100,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_101,negated_conjecture,
( n3 = pv1376
| n2 = pv1376
| n0 = pv1376
| X1 = n0
| X1 = pv1376
| ~ leq(X1,pv1376)
| ~ leq(n0,X1) ),
inference(spm,[status(thm)],[c_0_75,c_0_51]) ).
cnf(c_0_102,negated_conjecture,
leq(esk3_0,pv1376),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]),c_0_79]),c_0_80]) ).
cnf(c_0_103,negated_conjecture,
leq(n0,esk3_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_54]),c_0_82]),c_0_83]),c_0_84]),c_0_85]) ).
cnf(c_0_104,negated_conjecture,
a_select2(tptp_update2(s_values7_init,pv1376,init),esk3_0) != init,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_54]),c_0_87]),c_0_88]),c_0_89]),c_0_90]) ).
cnf(c_0_105,plain,
( a_select2(tptp_update2(X1,X2,X3),X4) = a_select2(X1,X4)
| X2 = X4 ),
inference(er,[status(thm)],[c_0_91]) ).
cnf(c_0_106,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_107,plain,
( gt(X1,X2)
| ~ leq(X2,pred(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_108,plain,
( gt(X1,X2)
| ~ gt(X3,X2)
| ~ gt(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_93]) ).
cnf(c_0_109,plain,
gt(n2,n0),
inference(split_conjunct,[status(thm)],[gt_2_0]) ).
fof(c_0_110,plain,
! [X3,X4] :
( ~ leq(succ(X3),X4)
| gt(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt])]) ).
cnf(c_0_111,plain,
succ(succ(succ(n0))) = n3,
inference(split_conjunct,[status(thm)],[successor_3]) ).
cnf(c_0_112,plain,
plus(plus(n0,n1),n1) = n2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_34]),c_0_34]) ).
cnf(c_0_113,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_114,plain,
( gt(n1,X1)
| ~ leq(X1,n0) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_115,negated_conjecture,
( a_select2(s_values7_init,n0) = init
| n3 = pv1376
| n2 = pv1376
| n0 = pv1376 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100])]) ).
cnf(c_0_116,negated_conjecture,
( esk3_0 = pv1376
| n0 = esk3_0
| n0 = pv1376
| n2 = pv1376
| n3 = pv1376 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103])]) ).
cnf(c_0_117,negated_conjecture,
( esk3_0 = pv1376
| a_select2(s_values7_init,esk3_0) != init ),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_118,negated_conjecture,
( leq(X1,n3)
| ~ leq(X1,pv1376) ),
inference(spm,[status(thm)],[c_0_106,c_0_39]) ).
fof(c_0_119,plain,
! [X3,X4] :
( ~ gt(X4,X3)
| leq(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])]) ).
cnf(c_0_120,plain,
( gt(X1,X2)
| ~ leq(X2,minus(X1,n1)) ),
inference(rw,[status(thm)],[c_0_107,c_0_36]) ).
fof(c_0_121,plain,
! [X3,X4,X3,X4] :
( ( ~ leq(succ(X3),succ(X4))
| leq(X3,X4) )
& ( ~ leq(X3,X4)
| leq(succ(X3),succ(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_succ])])])]) ).
fof(c_0_122,plain,
! [X2] : succ(pred(X2)) = X2,
inference(variable_rename,[status(thm)],[succ_pred]) ).
cnf(c_0_123,plain,
( gt(X1,n0)
| ~ gt(X1,n2) ),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_124,plain,
( gt(X1,X2)
| ~ leq(succ(X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_125,plain,
plus(plus(plus(n0,n1),n1),n1) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_111,c_0_34]),c_0_34]),c_0_34]) ).
cnf(c_0_126,plain,
plus(n1,n1) = n2,
inference(rw,[status(thm)],[c_0_112,c_0_97]) ).
cnf(c_0_127,plain,
~ leq(n1,n0),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_128,negated_conjecture,
( n0 = pv1376
| esk3_0 = pv1376
| n2 = pv1376
| n3 = pv1376 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_117]) ).
cnf(c_0_129,negated_conjecture,
( X1 = n0
| X1 = n1
| X1 = n2
| X1 = n3
| ~ leq(n0,X1)
| ~ leq(X1,pv1376) ),
inference(spm,[status(thm)],[c_0_38,c_0_118]) ).
cnf(c_0_130,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_131,plain,
gt(X1,minus(X1,n1)),
inference(spm,[status(thm)],[c_0_120,c_0_100]) ).
cnf(c_0_132,plain,
( leq(X1,X2)
| ~ leq(succ(X1),succ(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_133,plain,
succ(pred(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_122]) ).
cnf(c_0_134,plain,
~ gt(n0,n2),
inference(spm,[status(thm)],[c_0_113,c_0_123]) ).
cnf(c_0_135,plain,
( gt(X1,X2)
| ~ leq(plus(X2,n1),X1) ),
inference(rw,[status(thm)],[c_0_124,c_0_34]) ).
cnf(c_0_136,plain,
plus(n2,n1) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_97]),c_0_126]) ).
cnf(c_0_137,negated_conjecture,
( n3 = pv1376
| n2 = pv1376
| esk3_0 = pv1376
| ~ leq(n1,pv1376) ),
inference(spm,[status(thm)],[c_0_127,c_0_128]) ).
cnf(c_0_138,negated_conjecture,
( n3 = esk3_0
| n2 = esk3_0
| n1 = esk3_0
| n0 = esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_103]),c_0_102])]) ).
cnf(c_0_139,plain,
leq(minus(X1,n1),X1),
inference(spm,[status(thm)],[c_0_130,c_0_131]) ).
cnf(c_0_140,plain,
( leq(X1,X2)
| ~ leq(plus(X1,n1),plus(X2,n1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_132,c_0_34]),c_0_34]) ).
cnf(c_0_141,plain,
plus(minus(X1,n1),n1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_133,c_0_34]),c_0_36]) ).
cnf(c_0_142,plain,
~ leq(n3,n0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136]) ).
cnf(c_0_143,negated_conjecture,
( n0 = esk3_0
| n2 = esk3_0
| n3 = esk3_0
| esk3_0 = pv1376
| n2 = pv1376
| n3 = pv1376 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_102])]) ).
cnf(c_0_144,plain,
( gt(X1,n0)
| ~ gt(X1,n1) ),
inference(spm,[status(thm)],[c_0_108,c_0_50]) ).
cnf(c_0_145,plain,
( leq(X1,X2)
| ~ leq(X1,minus(X2,n1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_139]) ).
cnf(c_0_146,plain,
( leq(n1,X1)
| ~ leq(n2,plus(X1,n1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_42]),c_0_126]) ).
cnf(c_0_147,plain,
plus(n1,minus(X1,n1)) = X1,
inference(rw,[status(thm)],[c_0_141,c_0_42]) ).
cnf(c_0_148,negated_conjecture,
( n3 = pv1376
| n2 = pv1376
| esk3_0 = pv1376
| ~ leq(n3,pv1376) ),
inference(spm,[status(thm)],[c_0_142,c_0_128]) ).
cnf(c_0_149,negated_conjecture,
( n3 = esk3_0
| n2 = esk3_0
| n3 = pv1376
| n2 = pv1376
| esk3_0 = pv1376 ),
inference(spm,[status(thm)],[c_0_128,c_0_143]) ).
cnf(c_0_150,plain,
( gt(X1,n0)
| ~ leq(n2,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_135]),c_0_126]) ).
cnf(c_0_151,plain,
( leq(n1,X1)
| ~ leq(n2,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_42]),c_0_147]) ).
cnf(c_0_152,plain,
leq(n0,n1),
inference(spm,[status(thm)],[c_0_130,c_0_50]) ).
cnf(c_0_153,plain,
minus(n3,n1) = n2,
inference(spm,[status(thm)],[c_0_43,c_0_136]) ).
cnf(c_0_154,negated_conjecture,
( n3 = pv1376
| n2 = esk3_0
| n2 = pv1376
| esk3_0 = pv1376 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_102])]) ).
cnf(c_0_155,plain,
( leq(n0,X1)
| ~ leq(n2,X1) ),
inference(spm,[status(thm)],[c_0_130,c_0_150]) ).
cnf(c_0_156,negated_conjecture,
( a_select2(s_values7_init,n1) = init
| ~ leq(n2,minus(pv1376,n1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_151]),c_0_152])]) ).
cnf(c_0_157,negated_conjecture,
( minus(pv1376,n1) = n2
| esk3_0 = pv1376
| n2 = pv1376
| n2 = esk3_0 ),
inference(spm,[status(thm)],[c_0_153,c_0_154]) ).
fof(c_0_158,plain,
! [X3,X4] :
( ~ leq(X3,X4)
| X3 = X4
| gt(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt2])]) ).
cnf(c_0_159,negated_conjecture,
( a_select2(s_values7_init,n0) = init
| ~ leq(n2,minus(pv1376,n1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_155]),c_0_100])]) ).
cnf(c_0_160,negated_conjecture,
( a_select2(s_values7_init,n1) = init
| n2 = esk3_0
| n2 = pv1376
| esk3_0 = pv1376 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_156,c_0_157]),c_0_100])]) ).
cnf(c_0_161,plain,
( gt(X1,X2)
| X2 = X1
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_158]) ).
cnf(c_0_162,negated_conjecture,
( a_select2(s_values7_init,n0) = init
| n2 = esk3_0
| n2 = pv1376
| esk3_0 = pv1376 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_157]),c_0_100])]) ).
cnf(c_0_163,negated_conjecture,
( n0 = esk3_0
| n3 = esk3_0
| esk3_0 = pv1376
| n2 = pv1376
| n2 = esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_138]),c_0_117]) ).
cnf(c_0_164,plain,
( n0 = n2
| ~ leq(n2,n0) ),
inference(spm,[status(thm)],[c_0_134,c_0_161]) ).
cnf(c_0_165,negated_conjecture,
( n3 = esk3_0
| esk3_0 = pv1376
| n2 = pv1376
| n2 = esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_163]),c_0_117]) ).
cnf(c_0_166,negated_conjecture,
( n3 = pv1376
| esk3_0 = pv1376
| n2 = pv1376
| ~ leq(n2,pv1376) ),
inference(spm,[status(thm)],[c_0_164,c_0_128]) ).
cnf(c_0_167,negated_conjecture,
( n2 = esk3_0
| n2 = pv1376
| esk3_0 = pv1376 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_165]),c_0_102])]) ).
cnf(c_0_168,negated_conjecture,
( n2 = pv1376
| esk3_0 = pv1376
| n3 = pv1376 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_167]),c_0_102])]) ).
cnf(c_0_169,negated_conjecture,
( a_select2(s_values7_init,minus(pv1376,n1)) = init
| ~ leq(n0,minus(pv1376,n1)) ),
inference(spm,[status(thm)],[c_0_98,c_0_100]) ).
cnf(c_0_170,negated_conjecture,
( minus(pv1376,n1) = n2
| esk3_0 = pv1376
| n2 = pv1376 ),
inference(spm,[status(thm)],[c_0_153,c_0_168]) ).
cnf(c_0_171,plain,
leq(n0,n2),
inference(spm,[status(thm)],[c_0_130,c_0_109]) ).
cnf(c_0_172,negated_conjecture,
( a_select2(s_values7_init,n2) = init
| n2 = pv1376
| esk3_0 = pv1376 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_170]),c_0_171])]) ).
cnf(c_0_173,plain,
minus(n2,n1) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_42]),c_0_126]) ).
cnf(c_0_174,negated_conjecture,
( n2 = pv1376
| esk3_0 = pv1376 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_167]),c_0_117]) ).
cnf(c_0_175,negated_conjecture,
( minus(pv1376,n1) = n1
| esk3_0 = pv1376 ),
inference(spm,[status(thm)],[c_0_173,c_0_174]) ).
cnf(c_0_176,plain,
( gt(n3,X1)
| ~ leq(X1,n2) ),
inference(spm,[status(thm)],[c_0_96,c_0_136]) ).
cnf(c_0_177,negated_conjecture,
( a_select2(s_values7_init,minus(minus(pv1376,n1),n1)) = init
| ~ leq(n0,minus(minus(pv1376,n1),n1)) ),
inference(spm,[status(thm)],[c_0_98,c_0_139]) ).
cnf(c_0_178,plain,
minus(n1,n1) = n0,
inference(spm,[status(thm)],[c_0_43,c_0_97]) ).
cnf(c_0_179,negated_conjecture,
( a_select2(s_values7_init,n1) = init
| esk3_0 = pv1376 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_175]),c_0_152])]) ).
cnf(c_0_180,plain,
~ leq(n3,n2),
inference(spm,[status(thm)],[c_0_113,c_0_176]) ).
cnf(c_0_181,negated_conjecture,
( a_select2(s_values7_init,n0) = init
| esk3_0 = pv1376 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_177,c_0_175]),c_0_178]),c_0_178]),c_0_100])]) ).
cnf(c_0_182,negated_conjecture,
( n0 = esk3_0
| n2 = esk3_0
| n3 = esk3_0
| esk3_0 = pv1376 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_179,c_0_138]),c_0_117]) ).
cnf(c_0_183,negated_conjecture,
( esk3_0 = pv1376
| ~ leq(n3,pv1376) ),
inference(spm,[status(thm)],[c_0_180,c_0_174]) ).
cnf(c_0_184,negated_conjecture,
( n3 = esk3_0
| n2 = esk3_0
| esk3_0 = pv1376 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_181,c_0_182]),c_0_117]) ).
cnf(c_0_185,negated_conjecture,
( n2 = esk3_0
| esk3_0 = pv1376 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_183,c_0_184]),c_0_102])]) ).
fof(c_0_186,plain,
! [X18,X19,X20] : a_select2(tptp_update2(X18,X19,X20),X19) = X20,
inference(variable_rename,[status(thm)],[sel2_update_1]) ).
cnf(c_0_187,negated_conjecture,
esk3_0 = pv1376,
inference(spm,[status(thm)],[c_0_174,c_0_185]) ).
cnf(c_0_188,plain,
a_select2(tptp_update2(X1,X2,X3),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_186]) ).
cnf(c_0_189,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_187]),c_0_188])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV033+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 15 14:50:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.021 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 190
% 0.23/1.41 # Proof object clause steps : 144
% 0.23/1.41 # Proof object formula steps : 46
% 0.23/1.41 # Proof object conjectures : 86
% 0.23/1.41 # Proof object clause conjectures : 83
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 44
% 0.23/1.41 # Proof object initial formulas used : 25
% 0.23/1.41 # Proof object generating inferences : 65
% 0.23/1.41 # Proof object simplifying inferences : 106
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 85
% 0.23/1.41 # Removed by relevancy pruning/SinE : 21
% 0.23/1.41 # Initial clauses : 88
% 0.23/1.41 # Removed in clause preprocessing : 3
% 0.23/1.41 # Initial clauses in saturation : 85
% 0.23/1.41 # Processed clauses : 2330
% 0.23/1.41 # ...of these trivial : 63
% 0.23/1.41 # ...subsumed : 1359
% 0.23/1.41 # ...remaining for further processing : 908
% 0.23/1.41 # Other redundant clauses eliminated : 2
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 207
% 0.23/1.41 # Backward-rewritten : 140
% 0.23/1.41 # Generated clauses : 13326
% 0.23/1.41 # ...of the previous two non-trivial : 10112
% 0.23/1.41 # Contextual simplify-reflections : 470
% 0.23/1.41 # Paramodulations : 13311
% 0.23/1.41 # Factorizations : 11
% 0.23/1.41 # Equation resolutions : 4
% 0.23/1.41 # Current number of processed clauses : 561
% 0.23/1.41 # Positive orientable unit clauses : 116
% 0.23/1.41 # Positive unorientable unit clauses: 6
% 0.23/1.41 # Negative unit clauses : 50
% 0.23/1.41 # Non-unit-clauses : 389
% 0.23/1.41 # Current number of unprocessed clauses: 3391
% 0.23/1.41 # ...number of literals in the above : 12049
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 349
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 26466
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 8006
% 0.23/1.41 # Non-unit clause-clause subsumptions : 1496
% 0.23/1.41 # Unit Clause-clause subsumption calls : 1932
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 54
% 0.23/1.41 # BW rewrite match successes : 50
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 126080
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.423 s
% 0.23/1.41 # System time : 0.005 s
% 0.23/1.41 # Total time : 0.428 s
% 0.23/1.41 # Maximum resident set size: 8228 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------