TSTP Solution File: SWV199+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV199+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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:15:33 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 24
% Syntax : Number of formulae : 129 ( 77 unt; 0 def)
% Number of atoms : 440 ( 225 equ)
% Maximal formula atoms : 72 ( 3 avg)
% Number of connectives : 429 ( 118 ~; 115 |; 173 &)
% ( 3 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 42 ( 4 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 18 con; 0-3 aty)
% Number of variables : 120 ( 4 sgn 72 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_inuse_0010,conjecture,
( ( a_select2(rho_defuse,n0) = use
& a_select2(rho_defuse,n1) = use
& a_select2(rho_defuse,n2) = use
& a_select2(sigma_defuse,n0) = use
& a_select2(sigma_defuse,n1) = use
& a_select2(sigma_defuse,n2) = use
& a_select2(sigma_defuse,n3) = use
& a_select2(sigma_defuse,n4) = use
& a_select2(sigma_defuse,n5) = use
& a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(xinit_defuse,n3) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n5) = use
& a_select2(xinit_mean_defuse,n0) = use
& a_select2(xinit_mean_defuse,n1) = use
& a_select2(xinit_mean_defuse,n2) = use
& a_select2(xinit_mean_defuse,n3) = use
& a_select2(xinit_mean_defuse,n4) = use
& a_select2(xinit_mean_defuse,n5) = use
& a_select2(xinit_noise_defuse,n0) = use
& a_select2(xinit_noise_defuse,n1) = use
& a_select2(xinit_noise_defuse,n2) = use
& a_select2(xinit_noise_defuse,n3) = use
& a_select2(xinit_noise_defuse,n4) = use
& a_select2(xinit_noise_defuse,n5) = use
& leq(n0,pv5)
& leq(pv5,n0)
& leq(pv5,n998)
& ! [X14,X18] :
( ( leq(n0,X14)
& leq(n0,X18)
& leq(X14,n2)
& leq(X18,pred(pv5)) )
=> a_select3(u_defuse,X14,X18) = use )
& ! [X4,X20] :
( ( leq(n0,X4)
& leq(n0,X20)
& leq(X4,n2)
& leq(X20,pred(pv5)) )
=> a_select3(z_defuse,X4,X20) = use ) )
=> ! [X21,X22] :
( ( leq(n0,X21)
& leq(n0,X22)
& leq(X21,n2)
& leq(X22,pv5) )
=> ( ( ~ ( n0 = X21
& pv5 = X22 )
& ~ ( n1 = X21
& pv5 = X22 )
& ~ ( n2 = X21
& pv5 = X22 ) )
=> a_select3(z_defuse,X21,X22) = use ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',quaternion_ds1_inuse_0010) ).
fof(succ_plus_1_r,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(finite_domain_0,axiom,
! [X1] :
( ( leq(n0,X1)
& leq(X1,n0) )
=> X1 = n0 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',finite_domain_0) ).
fof(successor_2,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_2) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_1) ).
fof(leq_gt1,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(leq_succ_gt,axiom,
! [X1,X2] :
( leq(succ(X1),X2)
=> gt(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ_gt) ).
fof(successor_3,axiom,
succ(succ(succ(n0))) = n3,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_3) ).
fof(transitivity_gt,axiom,
! [X1,X2,X3] :
( ( gt(X1,X2)
& gt(X2,X3) )
=> gt(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_gt) ).
fof(transitivity_leq,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(gt_5_2,axiom,
gt(n5,n2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_5_2) ).
fof(leq_gt_pred,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).
fof(reflexivity_leq,axiom,
! [X1] : leq(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(leq_succ_succ,axiom,
! [X1,X2] :
( leq(succ(X1),succ(X2))
<=> leq(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ_succ) ).
fof(successor_4,axiom,
succ(succ(succ(succ(n0)))) = n4,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_4) ).
fof(gt_3_2,axiom,
gt(n3,n2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_3_2) ).
fof(finite_domain_5,axiom,
! [X1] :
( ( leq(n0,X1)
& leq(X1,n5) )
=> ( X1 = n0
| X1 = n1
| X1 = n2
| X1 = n3
| X1 = n4
| X1 = n5 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',finite_domain_5) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(succ_plus_1_l,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_plus_1_l) ).
fof(succ_plus_2_r,axiom,
! [X1] : plus(X1,n2) = succ(succ(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_plus_2_r) ).
fof(successor_5,axiom,
succ(succ(succ(succ(succ(n0))))) = n5,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_5) ).
fof(leq_gt2,axiom,
! [X1,X2] :
( ( leq(X1,X2)
& X1 != X2 )
=> gt(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt2) ).
fof(c_0_23,plain,
( epred1_0
<=> ( a_select2(rho_defuse,n0) = use
& a_select2(rho_defuse,n1) = use
& a_select2(rho_defuse,n2) = use
& a_select2(sigma_defuse,n0) = use
& a_select2(sigma_defuse,n1) = use
& a_select2(sigma_defuse,n2) = use
& a_select2(sigma_defuse,n3) = use
& a_select2(sigma_defuse,n4) = use
& a_select2(sigma_defuse,n5) = use
& a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(xinit_defuse,n3) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n5) = use
& a_select2(xinit_mean_defuse,n0) = use
& a_select2(xinit_mean_defuse,n1) = use
& a_select2(xinit_mean_defuse,n2) = use
& a_select2(xinit_mean_defuse,n3) = use
& a_select2(xinit_mean_defuse,n4) = use
& a_select2(xinit_mean_defuse,n5) = use
& a_select2(xinit_noise_defuse,n0) = use
& a_select2(xinit_noise_defuse,n1) = use
& a_select2(xinit_noise_defuse,n2) = use
& a_select2(xinit_noise_defuse,n3) = use
& a_select2(xinit_noise_defuse,n4) = use
& a_select2(xinit_noise_defuse,n5) = use
& leq(n0,pv5)
& leq(pv5,n0)
& leq(pv5,n998)
& ! [X14,X18] :
( ( leq(n0,X14)
& leq(n0,X18)
& leq(X14,n2)
& leq(X18,pred(pv5)) )
=> a_select3(u_defuse,X14,X18) = use )
& ! [X4,X20] :
( ( leq(n0,X4)
& leq(n0,X20)
& leq(X4,n2)
& leq(X20,pred(pv5)) )
=> a_select3(z_defuse,X4,X20) = use ) ) ),
introduced(definition) ).
fof(c_0_24,plain,
( epred1_0
=> ( a_select2(rho_defuse,n0) = use
& a_select2(rho_defuse,n1) = use
& a_select2(rho_defuse,n2) = use
& a_select2(sigma_defuse,n0) = use
& a_select2(sigma_defuse,n1) = use
& a_select2(sigma_defuse,n2) = use
& a_select2(sigma_defuse,n3) = use
& a_select2(sigma_defuse,n4) = use
& a_select2(sigma_defuse,n5) = use
& a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(xinit_defuse,n3) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n5) = use
& a_select2(xinit_mean_defuse,n0) = use
& a_select2(xinit_mean_defuse,n1) = use
& a_select2(xinit_mean_defuse,n2) = use
& a_select2(xinit_mean_defuse,n3) = use
& a_select2(xinit_mean_defuse,n4) = use
& a_select2(xinit_mean_defuse,n5) = use
& a_select2(xinit_noise_defuse,n0) = use
& a_select2(xinit_noise_defuse,n1) = use
& a_select2(xinit_noise_defuse,n2) = use
& a_select2(xinit_noise_defuse,n3) = use
& a_select2(xinit_noise_defuse,n4) = use
& a_select2(xinit_noise_defuse,n5) = use
& leq(n0,pv5)
& leq(pv5,n0)
& leq(pv5,n998)
& ! [X14,X18] :
( ( leq(n0,X14)
& leq(n0,X18)
& leq(X14,n2)
& leq(X18,pred(pv5)) )
=> a_select3(u_defuse,X14,X18) = use )
& ! [X4,X20] :
( ( leq(n0,X4)
& leq(n0,X20)
& leq(X4,n2)
& leq(X20,pred(pv5)) )
=> a_select3(z_defuse,X4,X20) = use ) ) ),
inference(split_equiv,[status(thm)],[c_0_23]) ).
fof(c_0_25,negated_conjecture,
~ ( epred1_0
=> ! [X21,X22] :
( ( leq(n0,X21)
& leq(n0,X22)
& leq(X21,n2)
& leq(X22,pv5) )
=> ( ( ~ ( n0 = X21
& pv5 = X22 )
& ~ ( n1 = X21
& pv5 = X22 )
& ~ ( n2 = X21
& pv5 = X22 ) )
=> a_select3(z_defuse,X21,X22) = use ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[quaternion_ds1_inuse_0010]),c_0_23]) ).
fof(c_0_26,plain,
! [X21,X22,X23,X24] :
( ( a_select2(rho_defuse,n0) = use
| ~ epred1_0 )
& ( a_select2(rho_defuse,n1) = use
| ~ epred1_0 )
& ( a_select2(rho_defuse,n2) = use
| ~ epred1_0 )
& ( a_select2(sigma_defuse,n0) = use
| ~ epred1_0 )
& ( a_select2(sigma_defuse,n1) = use
| ~ epred1_0 )
& ( a_select2(sigma_defuse,n2) = use
| ~ epred1_0 )
& ( a_select2(sigma_defuse,n3) = use
| ~ epred1_0 )
& ( a_select2(sigma_defuse,n4) = use
| ~ epred1_0 )
& ( a_select2(sigma_defuse,n5) = use
| ~ epred1_0 )
& ( a_select3(u_defuse,n0,n0) = use
| ~ epred1_0 )
& ( a_select3(u_defuse,n1,n0) = use
| ~ epred1_0 )
& ( a_select3(u_defuse,n2,n0) = use
| ~ epred1_0 )
& ( a_select2(xinit_defuse,n3) = use
| ~ epred1_0 )
& ( a_select2(xinit_defuse,n4) = use
| ~ epred1_0 )
& ( a_select2(xinit_defuse,n5) = use
| ~ epred1_0 )
& ( a_select2(xinit_mean_defuse,n0) = use
| ~ epred1_0 )
& ( a_select2(xinit_mean_defuse,n1) = use
| ~ epred1_0 )
& ( a_select2(xinit_mean_defuse,n2) = use
| ~ epred1_0 )
& ( a_select2(xinit_mean_defuse,n3) = use
| ~ epred1_0 )
& ( a_select2(xinit_mean_defuse,n4) = use
| ~ epred1_0 )
& ( a_select2(xinit_mean_defuse,n5) = use
| ~ epred1_0 )
& ( a_select2(xinit_noise_defuse,n0) = use
| ~ epred1_0 )
& ( a_select2(xinit_noise_defuse,n1) = use
| ~ epred1_0 )
& ( a_select2(xinit_noise_defuse,n2) = use
| ~ epred1_0 )
& ( a_select2(xinit_noise_defuse,n3) = use
| ~ epred1_0 )
& ( a_select2(xinit_noise_defuse,n4) = use
| ~ epred1_0 )
& ( a_select2(xinit_noise_defuse,n5) = use
| ~ epred1_0 )
& ( leq(n0,pv5)
| ~ epred1_0 )
& ( leq(pv5,n0)
| ~ epred1_0 )
& ( leq(pv5,n998)
| ~ epred1_0 )
& ( ~ leq(n0,X21)
| ~ leq(n0,X22)
| ~ leq(X21,n2)
| ~ leq(X22,pred(pv5))
| a_select3(u_defuse,X21,X22) = use
| ~ epred1_0 )
& ( ~ leq(n0,X23)
| ~ leq(n0,X24)
| ~ leq(X23,n2)
| ~ leq(X24,pred(pv5))
| a_select3(z_defuse,X23,X24) = use
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])])])]) ).
fof(c_0_27,negated_conjecture,
( epred1_0
& leq(n0,esk1_0)
& leq(n0,esk2_0)
& leq(esk1_0,n2)
& leq(esk2_0,pv5)
& ( n0 != esk1_0
| pv5 != esk2_0 )
& ( n1 != esk1_0
| pv5 != esk2_0 )
& ( n2 != esk1_0
| pv5 != esk2_0 )
& a_select3(z_defuse,esk1_0,esk2_0) != use ),
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_28,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).
fof(c_0_29,plain,
! [X2] :
( ~ leq(n0,X2)
| ~ leq(X2,n0)
| X2 = n0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_0])]) ).
cnf(c_0_30,plain,
( leq(pv5,n0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
( leq(n0,pv5)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
succ(succ(n0)) = n2,
inference(split_conjunct,[status(thm)],[successor_2]) ).
cnf(c_0_34,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_36,plain,
( X1 = n0
| ~ leq(X1,n0)
| ~ leq(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,plain,
leq(pv5,n0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_38,plain,
leq(n0,pv5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_31])]) ).
fof(c_0_39,plain,
! [X3,X4] :
( ~ gt(X4,X3)
| leq(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])]) ).
fof(c_0_40,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_41,plain,
succ(succ(succ(n0))) = n3,
inference(split_conjunct,[status(thm)],[successor_3]) ).
cnf(c_0_42,plain,
plus(plus(n0,n1),n1) = n2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_34]) ).
cnf(c_0_43,plain,
plus(n0,n1) = n1,
inference(rw,[status(thm)],[c_0_35,c_0_34]) ).
fof(c_0_44,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_45,plain,
n0 = pv5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_46,negated_conjecture,
leq(n0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_47,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])]) ).
cnf(c_0_48,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_49,plain,
gt(n5,n2),
inference(split_conjunct,[status(thm)],[gt_5_2]) ).
cnf(c_0_50,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_51,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])])])]) ).
fof(c_0_52,plain,
! [X2] : leq(X2,X2),
inference(variable_rename,[status(thm)],[reflexivity_leq]) ).
fof(c_0_53,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[irreflexivity_gt])]) ).
cnf(c_0_54,plain,
( gt(X1,X2)
| ~ leq(succ(X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
fof(c_0_55,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])])])]) ).
cnf(c_0_56,plain,
succ(succ(succ(succ(n0)))) = n4,
inference(split_conjunct,[status(thm)],[successor_4]) ).
cnf(c_0_57,plain,
plus(plus(plus(n0,n1),n1),n1) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_34]),c_0_34]),c_0_34]) ).
cnf(c_0_58,plain,
plus(n1,n1) = n2,
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_59,plain,
( gt(X1,X2)
| ~ gt(X3,X2)
| ~ gt(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_60,plain,
gt(n3,n2),
inference(split_conjunct,[status(thm)],[gt_3_2]) ).
fof(c_0_61,plain,
! [X2] :
( ~ leq(n0,X2)
| ~ leq(X2,n5)
| X2 = n0
| X2 = n1
| X2 = n2
| X2 = n3
| X2 = n4
| X2 = n5 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_5])]) ).
cnf(c_0_62,plain,
( X1 = pv5
| ~ leq(X1,pv5)
| ~ leq(pv5,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_45]),c_0_45]),c_0_45]) ).
cnf(c_0_63,negated_conjecture,
leq(esk2_0,pv5),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_64,negated_conjecture,
leq(pv5,esk2_0),
inference(rw,[status(thm)],[c_0_46,c_0_45]) ).
cnf(c_0_65,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_66,plain,
leq(n2,n5),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_67,negated_conjecture,
leq(pv5,esk1_0),
inference(rw,[status(thm)],[c_0_50,c_0_45]) ).
cnf(c_0_68,negated_conjecture,
( pv5 != esk2_0
| n0 != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_69,plain,
( gt(X1,X2)
| ~ leq(X2,pred(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_70,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
fof(c_0_71,plain,
! [X2] : pred(succ(X2)) = X2,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_72,plain,
! [X2] : plus(n1,X2) = succ(X2),
inference(variable_rename,[status(thm)],[succ_plus_1_l]) ).
fof(c_0_73,plain,
! [X2] : plus(X2,n2) = succ(succ(X2)),
inference(variable_rename,[status(thm)],[succ_plus_2_r]) ).
cnf(c_0_74,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_75,plain,
( gt(X1,X2)
| ~ leq(plus(X2,n1),X1) ),
inference(rw,[status(thm)],[c_0_54,c_0_34]) ).
cnf(c_0_76,negated_conjecture,
leq(esk1_0,n2),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_77,plain,
( leq(X1,X2)
| ~ leq(succ(X1),succ(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_78,plain,
plus(plus(plus(plus(n0,n1),n1),n1),n1) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_34]),c_0_34]),c_0_34]),c_0_34]) ).
cnf(c_0_79,plain,
plus(n2,n1) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_43]),c_0_58]) ).
cnf(c_0_80,plain,
succ(succ(succ(succ(succ(n0))))) = n5,
inference(split_conjunct,[status(thm)],[successor_5]) ).
cnf(c_0_81,plain,
( gt(X1,n2)
| ~ gt(X1,n3) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
fof(c_0_82,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_83,plain,
( X1 = n5
| X1 = n4
| X1 = n3
| X1 = n2
| X1 = n1
| X1 = n0
| ~ leq(X1,n5)
| ~ leq(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_84,negated_conjecture,
pv5 = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).
cnf(c_0_85,plain,
( leq(X1,n5)
| ~ leq(X1,n2) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_86,negated_conjecture,
( leq(X1,esk1_0)
| ~ leq(X1,pv5) ),
inference(spm,[status(thm)],[c_0_65,c_0_67]) ).
cnf(c_0_87,negated_conjecture,
( pv5 != esk1_0
| pv5 != esk2_0 ),
inference(rw,[status(thm)],[c_0_68,c_0_45]) ).
cnf(c_0_88,negated_conjecture,
( pv5 != esk2_0
| n1 != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_89,negated_conjecture,
( pv5 != esk2_0
| n2 != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_90,plain,
gt(X1,pred(X1)),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_91,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_92,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_93,plain,
plus(X1,n2) = succ(succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_94,plain,
~ leq(plus(X1,n1),X1),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_95,negated_conjecture,
( leq(X1,n2)
| ~ leq(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_65,c_0_76]) ).
cnf(c_0_96,plain,
( leq(X1,X2)
| ~ leq(plus(X1,n1),plus(X2,n1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_34]),c_0_34]) ).
cnf(c_0_97,plain,
plus(n3,n1) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_43]),c_0_58]),c_0_79]) ).
cnf(c_0_98,plain,
plus(plus(plus(plus(plus(n0,n1),n1),n1),n1),n1) = n5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_34]),c_0_34]),c_0_34]),c_0_34]),c_0_34]) ).
cnf(c_0_99,plain,
~ gt(n2,n3),
inference(spm,[status(thm)],[c_0_74,c_0_81]) ).
cnf(c_0_100,plain,
( gt(X1,X2)
| X2 = X1
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_101,plain,
( X1 = esk2_0
| X1 = n1
| X1 = n2
| X1 = n3
| X1 = n4
| X1 = n5
| ~ leq(X1,n5)
| ~ leq(esk2_0,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_45]),c_0_45]),c_0_84]),c_0_84]) ).
cnf(c_0_102,negated_conjecture,
leq(esk1_0,n5),
inference(spm,[status(thm)],[c_0_85,c_0_76]) ).
cnf(c_0_103,negated_conjecture,
leq(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_86,c_0_63]) ).
cnf(c_0_104,negated_conjecture,
esk2_0 != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_84]),c_0_84])]) ).
cnf(c_0_105,negated_conjecture,
n1 != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_84])]) ).
cnf(c_0_106,negated_conjecture,
n2 != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_84])]) ).
cnf(c_0_107,plain,
leq(pred(X1),X1),
inference(spm,[status(thm)],[c_0_48,c_0_90]) ).
cnf(c_0_108,plain,
pred(plus(X1,n1)) = X1,
inference(rw,[status(thm)],[c_0_91,c_0_34]) ).
cnf(c_0_109,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[c_0_92,c_0_34]) ).
cnf(c_0_110,plain,
plus(X1,n2) = plus(plus(X1,n1),n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_34]),c_0_34]) ).
cnf(c_0_111,negated_conjecture,
~ leq(n3,esk1_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_79]) ).
cnf(c_0_112,plain,
( leq(n3,X1)
| ~ leq(n4,plus(X1,n1)) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_113,plain,
plus(n4,n1) = n5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_43]),c_0_58]),c_0_79]),c_0_97]) ).
cnf(c_0_114,plain,
( n2 = n3
| ~ leq(n3,n2) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_115,negated_conjecture,
( n5 = esk1_0
| n4 = esk1_0
| n3 = esk1_0 ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103])]),c_0_104]),c_0_105]),c_0_106]) ).
cnf(c_0_116,plain,
gt(X1,pred(pred(X1))),
inference(spm,[status(thm)],[c_0_69,c_0_107]) ).
cnf(c_0_117,plain,
pred(plus(n1,X1)) = X1,
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_118,plain,
plus(n1,plus(X1,n1)) = plus(X1,n2),
inference(rw,[status(thm)],[c_0_110,c_0_109]) ).
cnf(c_0_119,negated_conjecture,
~ leq(n4,plus(esk1_0,n1)),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_120,plain,
( leq(n4,X1)
| ~ leq(n5,plus(X1,n1)) ),
inference(spm,[status(thm)],[c_0_96,c_0_113]) ).
cnf(c_0_121,plain,
~ leq(n4,n2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_75]),c_0_97]) ).
cnf(c_0_122,negated_conjecture,
( n4 = esk1_0
| n5 = esk1_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_76])]),c_0_106]) ).
cnf(c_0_123,plain,
leq(pred(pred(X1)),X1),
inference(spm,[status(thm)],[c_0_48,c_0_116]) ).
cnf(c_0_124,plain,
pred(plus(X1,n2)) = plus(X1,n1),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_125,negated_conjecture,
~ leq(n5,plus(esk1_0,n2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_109]),c_0_118]) ).
cnf(c_0_126,negated_conjecture,
n5 = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_76])]) ).
cnf(c_0_127,plain,
leq(X1,plus(X1,n2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_108]) ).
cnf(c_0_128,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_126]),c_0_127])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV199+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n012.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 16:15:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.019 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 129
% 0.22/1.41 # Proof object clause steps : 86
% 0.22/1.41 # Proof object formula steps : 43
% 0.22/1.41 # Proof object conjectures : 29
% 0.22/1.41 # Proof object clause conjectures : 26
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 32
% 0.22/1.41 # Proof object initial formulas used : 23
% 0.22/1.41 # Proof object generating inferences : 28
% 0.22/1.41 # Proof object simplifying inferences : 76
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 92
% 0.22/1.41 # Removed by relevancy pruning/SinE : 26
% 0.22/1.41 # Initial clauses : 109
% 0.22/1.41 # Removed in clause preprocessing : 1
% 0.22/1.41 # Initial clauses in saturation : 108
% 0.22/1.41 # Processed clauses : 1309
% 0.22/1.41 # ...of these trivial : 99
% 0.22/1.41 # ...subsumed : 608
% 0.22/1.41 # ...remaining for further processing : 602
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 12
% 0.22/1.41 # Backward-rewritten : 185
% 0.22/1.41 # Generated clauses : 4816
% 0.22/1.41 # ...of the previous two non-trivial : 3207
% 0.22/1.41 # Contextual simplify-reflections : 55
% 0.22/1.41 # Paramodulations : 4812
% 0.22/1.41 # Factorizations : 4
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 405
% 0.22/1.41 # Positive orientable unit clauses : 162
% 0.22/1.41 # Positive unorientable unit clauses: 7
% 0.22/1.41 # Negative unit clauses : 57
% 0.22/1.41 # Non-unit-clauses : 179
% 0.22/1.41 # Current number of unprocessed clauses: 1382
% 0.22/1.41 # ...number of literals in the above : 3341
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 198
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 4061
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 3670
% 0.22/1.41 # Non-unit clause-clause subsumptions : 255
% 0.22/1.41 # Unit Clause-clause subsumption calls : 2672
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 47
% 0.22/1.41 # BW rewrite match successes : 39
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 43561
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.103 s
% 0.22/1.41 # System time : 0.004 s
% 0.22/1.41 # Total time : 0.107 s
% 0.22/1.41 # Maximum resident set size: 5624 pages
%------------------------------------------------------------------------------