TSTP Solution File: SWV089+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV089+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 600s
% DateTime : Wed Jul 20 18:15:08 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 22
% Syntax : Number of formulae : 105 ( 74 unt; 0 def)
% Number of atoms : 204 ( 168 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 150 ( 51 ~; 79 |; 15 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 9 con; 0-4 aty)
% Number of variables : 131 ( 7 sgn 64 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_inuse_0001,conjecture,
( true
=> ( a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n0,n0) = use
& a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) = use
& a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n3) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n4) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n5) = use ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',quaternion_ds1_inuse_0001) ).
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(sel3_update_1,axiom,
! [X1,X7,X24,X17] : a_select3(tptp_update3(X1,X7,X24,X17),X7,X24) = X17,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sel3_update_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(sel3_update_2,axiom,
! [X5,X11,X7,X24,X1,X17,X25] :
( ( X5 != X7
& X11 = X24
& a_select3(X1,X7,X24) = X17 )
=> a_select3(tptp_update3(X1,X5,X11,X25),X7,X24) = X17 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sel3_update_2) ).
fof(succ_plus_2_r,axiom,
! [X1] : plus(X1,n2) = succ(succ(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_2_r) ).
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(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_3_r,axiom,
! [X1] : plus(X1,n3) = succ(succ(succ(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_3_r) ).
fof(succ_plus_4_r,axiom,
! [X1] : plus(X1,n4) = succ(succ(succ(succ(X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_4_r) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_1) ).
fof(successor_2,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_2) ).
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(succ_plus_5_r,axiom,
! [X1] : plus(X1,n5) = succ(succ(succ(succ(succ(X1))))),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_5_r) ).
fof(succ_plus_4_l,axiom,
! [X1] : plus(n4,X1) = succ(succ(succ(succ(X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_4_l) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(gt_2_1,axiom,
gt(n2,n1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_2_1) ).
fof(succ_plus_5_l,axiom,
! [X1] : plus(n5,X1) = succ(succ(succ(succ(succ(X1))))),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_5_l) ).
fof(gt_succ,axiom,
! [X1] : gt(succ(X1),X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',gt_succ) ).
fof(gt_1_0,axiom,
gt(n1,n0),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_1_0) ).
fof(gt_5_4,axiom,
gt(n5,n4),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_5_4) ).
fof(gt_4_3,axiom,
gt(n4,n3),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_4_3) ).
fof(c_0_22,negated_conjecture,
~ ( true
=> ( a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n0,n0) = use
& a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) = use
& a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n3) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n4) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n5) = use ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_inuse_0001]) ).
fof(c_0_23,negated_conjecture,
( true
& ( a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n0,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n3) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n5) != use ) ),
inference(fof_nnf,[status(thm)],[c_0_22]) ).
fof(c_0_24,plain,
! [X18,X19,X20] : a_select2(tptp_update2(X18,X19,X20),X19) = X20,
inference(variable_rename,[status(thm)],[sel2_update_1]) ).
fof(c_0_25,plain,
! [X25,X26,X27,X28] : a_select3(tptp_update3(X25,X26,X27,X28),X26,X27) = X28,
inference(variable_rename,[status(thm)],[sel3_update_1]) ).
fof(c_0_26,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_27,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n3) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n0,n0) != use ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
a_select2(tptp_update2(X1,X2,X3),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
a_select3(tptp_update3(X1,X2,X3,X4),X2,X3) = X4,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( a_select2(tptp_update2(X1,X2,X3),X4) = X5
| X2 = X4
| a_select2(X1,X4) != X5 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n5) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),c_0_29])]) ).
cnf(c_0_32,plain,
( a_select2(tptp_update2(X1,X2,X3),X4) = a_select2(X1,X4)
| X2 = X4 ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( n3 = n4
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n5) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_28])]) ).
fof(c_0_34,plain,
! [X26,X27,X28,X29,X30,X31,X32] :
( X26 = X28
| X27 != X29
| a_select3(X30,X28,X29) != X31
| a_select3(tptp_update3(X30,X26,X27,X32),X28,X29) = X31 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sel3_update_2])])])]) ).
cnf(c_0_35,negated_conjecture,
( n3 = n5
| n3 = n4
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n5) != use ),
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_36,plain,
( a_select3(tptp_update3(X1,X2,X3,X4),X5,X6) = X7
| X2 = X5
| a_select3(X1,X5,X6) != X7
| X3 != X6 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( n4 = n5
| n3 = n4
| n3 = n5
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n5) != use ),
inference(spm,[status(thm)],[c_0_35,c_0_32]) ).
cnf(c_0_38,plain,
( a_select3(tptp_update3(X1,X2,X3,X4),X5,X3) = X6
| X2 = X5
| a_select3(X1,X5,X3) != X6 ),
inference(er,[status(thm)],[c_0_36]) ).
fof(c_0_39,plain,
! [X2] : plus(X2,n2) = succ(succ(X2)),
inference(variable_rename,[status(thm)],[succ_plus_2_r]) ).
fof(c_0_40,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).
fof(c_0_41,plain,
! [X2] : plus(n1,X2) = succ(X2),
inference(variable_rename,[status(thm)],[succ_plus_1_l]) ).
cnf(c_0_42,negated_conjecture,
( n3 = n5
| n3 = n4
| n4 = n5
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_32]),c_0_28])]) ).
cnf(c_0_43,plain,
( a_select3(tptp_update3(X1,X2,X3,X4),X5,X3) = a_select3(X1,X5,X3)
| X2 = X5 ),
inference(er,[status(thm)],[c_0_38]) ).
fof(c_0_44,plain,
! [X2] : plus(X2,n3) = succ(succ(succ(X2))),
inference(variable_rename,[status(thm)],[succ_plus_3_r]) ).
cnf(c_0_45,plain,
plus(X1,n2) = succ(succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( n0 = n1
| n4 = n5
| n3 = n4
| n3 = n5
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_29])]) ).
fof(c_0_49,plain,
! [X2] : plus(X2,n4) = succ(succ(succ(succ(X2)))),
inference(variable_rename,[status(thm)],[succ_plus_4_r]) ).
cnf(c_0_50,plain,
plus(X1,n3) = succ(succ(succ(X1))),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,plain,
plus(X1,n2) = plus(plus(X1,n1),n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_46]) ).
cnf(c_0_52,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[c_0_47,c_0_46]) ).
cnf(c_0_53,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_54,negated_conjecture,
( n0 = n2
| n3 = n5
| n3 = n4
| n4 = n5
| n0 = n1
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n2,n0) != use ),
inference(spm,[status(thm)],[c_0_48,c_0_43]) ).
cnf(c_0_55,plain,
succ(succ(n0)) = n2,
inference(split_conjunct,[status(thm)],[successor_2]) ).
fof(c_0_56,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])]) ).
fof(c_0_57,plain,
! [X2] : plus(X2,n5) = succ(succ(succ(succ(succ(X2))))),
inference(variable_rename,[status(thm)],[succ_plus_5_r]) ).
cnf(c_0_58,plain,
plus(X1,n4) = succ(succ(succ(succ(X1)))),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_59,plain,
plus(X1,n3) = plus(plus(plus(X1,n1),n1),n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_46]),c_0_46]),c_0_46]) ).
cnf(c_0_60,plain,
plus(n1,plus(X1,n1)) = plus(X1,n2),
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
fof(c_0_61,plain,
! [X2] : plus(n4,X2) = succ(succ(succ(succ(X2)))),
inference(variable_rename,[status(thm)],[succ_plus_4_l]) ).
cnf(c_0_62,plain,
plus(n0,n1) = n1,
inference(rw,[status(thm)],[c_0_53,c_0_46]) ).
cnf(c_0_63,negated_conjecture,
( n1 = n2
| n0 = n1
| n4 = n5
| n3 = n4
| n3 = n5
| n0 = n2
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n2,n0) != use ),
inference(spm,[status(thm)],[c_0_54,c_0_43]) ).
cnf(c_0_64,plain,
plus(plus(n0,n1),n1) = n2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_46]),c_0_46]) ).
fof(c_0_65,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[irreflexivity_gt])]) ).
cnf(c_0_66,plain,
( gt(X1,X2)
| ~ gt(X3,X2)
| ~ gt(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_67,plain,
gt(n2,n1),
inference(split_conjunct,[status(thm)],[gt_2_1]) ).
fof(c_0_68,plain,
! [X2] : plus(n5,X2) = succ(succ(succ(succ(succ(X2))))),
inference(variable_rename,[status(thm)],[succ_plus_5_l]) ).
cnf(c_0_69,plain,
plus(X1,n5) = succ(succ(succ(succ(succ(X1))))),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_70,plain,
plus(X1,n4) = plus(plus(plus(plus(X1,n1),n1),n1),n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_46]),c_0_46]),c_0_46]),c_0_46]) ).
cnf(c_0_71,plain,
plus(n1,plus(X1,n2)) = plus(X1,n3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_52]),c_0_60]),c_0_52]) ).
cnf(c_0_72,plain,
plus(n4,X1) = succ(succ(succ(succ(X1)))),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_73,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_62,c_0_52]) ).
cnf(c_0_74,negated_conjecture,
( n0 = n2
| n3 = n5
| n3 = n4
| n4 = n5
| n0 = n1
| n1 = n2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_43]),c_0_29])]) ).
cnf(c_0_75,plain,
plus(n1,n1) = n2,
inference(rw,[status(thm)],[c_0_64,c_0_62]) ).
cnf(c_0_76,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_77,plain,
( gt(X1,n1)
| ~ gt(X1,n2) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
fof(c_0_78,plain,
! [X2] : gt(succ(X2),X2),
inference(variable_rename,[status(thm)],[gt_succ]) ).
cnf(c_0_79,plain,
plus(n5,X1) = succ(succ(succ(succ(succ(X1))))),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_80,plain,
plus(X1,n5) = plus(plus(plus(plus(plus(X1,n1),n1),n1),n1),n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_46]),c_0_46]),c_0_46]),c_0_46]),c_0_46]) ).
cnf(c_0_81,plain,
plus(n1,plus(X1,n3)) = plus(X1,n4),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_52]),c_0_60]),c_0_52]),c_0_71]),c_0_52]) ).
cnf(c_0_82,plain,
plus(n4,X1) = plus(plus(plus(plus(X1,n1),n1),n1),n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_46]),c_0_46]),c_0_46]),c_0_46]) ).
cnf(c_0_83,plain,
gt(n1,n0),
inference(split_conjunct,[status(thm)],[gt_1_0]) ).
cnf(c_0_84,negated_conjecture,
( n4 = n5
| n3 = n4
| n3 = n5
| n0 = n2
| n1 = n2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75])]) ).
cnf(c_0_85,plain,
~ gt(n1,n2),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_86,plain,
gt(succ(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_87,plain,
plus(n5,X1) = plus(plus(plus(plus(plus(X1,n1),n1),n1),n1),n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_46]),c_0_46]),c_0_46]),c_0_46]),c_0_46]) ).
cnf(c_0_88,plain,
plus(n1,plus(X1,n4)) = plus(X1,n5),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[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_52]),c_0_60]),c_0_52]),c_0_71]),c_0_52]),c_0_81]),c_0_52]) ).
cnf(c_0_89,plain,
plus(X1,n4) = plus(n4,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_52]),c_0_60]),c_0_52]),c_0_71]),c_0_52]),c_0_81]) ).
cnf(c_0_90,negated_conjecture,
( n1 = n2
| n3 = n5
| n3 = n4
| n4 = n5 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]) ).
cnf(c_0_91,plain,
gt(n5,n4),
inference(split_conjunct,[status(thm)],[gt_5_4]) ).
cnf(c_0_92,plain,
gt(plus(X1,n1),X1),
inference(rw,[status(thm)],[c_0_86,c_0_46]) ).
cnf(c_0_93,plain,
plus(X1,n5) = plus(n5,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_52]),c_0_60]),c_0_52]),c_0_71]),c_0_52]),c_0_81]),c_0_52]),c_0_88]) ).
cnf(c_0_94,plain,
plus(n1,plus(n4,X1)) = plus(X1,n5),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_95,plain,
gt(n4,n3),
inference(split_conjunct,[status(thm)],[gt_4_3]) ).
cnf(c_0_96,negated_conjecture,
( n4 = n5
| n3 = n4
| n3 = n5 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_90]),c_0_76]) ).
cnf(c_0_97,plain,
( gt(X1,n4)
| ~ gt(X1,n5) ),
inference(spm,[status(thm)],[c_0_66,c_0_91]) ).
cnf(c_0_98,plain,
gt(plus(n1,X1),X1),
inference(spm,[status(thm)],[c_0_92,c_0_52]) ).
cnf(c_0_99,plain,
plus(n1,plus(n4,X1)) = plus(n5,X1),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_100,negated_conjecture,
( n3 = n5
| n4 = n5 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_76]) ).
cnf(c_0_101,plain,
~ gt(n4,n5),
inference(spm,[status(thm)],[c_0_76,c_0_97]) ).
cnf(c_0_102,plain,
gt(plus(n5,X1),plus(n4,X1)),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_103,negated_conjecture,
n4 = n5,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_100]),c_0_101]) ).
cnf(c_0_104,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_103]),c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV089+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.08/0.13 % Command : run_ET %s %d
% 0.15/0.34 % Computer : n028.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 600
% 0.15/0.34 % DateTime : Wed Jun 15 00:50:09 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.022 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 105
% 0.25/1.43 # Proof object clause steps : 66
% 0.25/1.43 # Proof object formula steps : 39
% 0.25/1.43 # Proof object conjectures : 18
% 0.25/1.43 # Proof object clause conjectures : 15
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 22
% 0.25/1.43 # Proof object initial formulas used : 22
% 0.25/1.43 # Proof object generating inferences : 23
% 0.25/1.43 # Proof object simplifying inferences : 81
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 85
% 0.25/1.43 # Removed by relevancy pruning/SinE : 21
% 0.25/1.43 # Initial clauses : 77
% 0.25/1.43 # Removed in clause preprocessing : 1
% 0.25/1.43 # Initial clauses in saturation : 76
% 0.25/1.43 # Processed clauses : 1768
% 0.25/1.43 # ...of these trivial : 134
% 0.25/1.43 # ...subsumed : 1014
% 0.25/1.43 # ...remaining for further processing : 620
% 0.25/1.43 # Other redundant clauses eliminated : 4
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 25
% 0.25/1.43 # Backward-rewritten : 228
% 0.25/1.43 # Generated clauses : 8186
% 0.25/1.43 # ...of the previous two non-trivial : 5101
% 0.25/1.43 # Contextual simplify-reflections : 58
% 0.25/1.43 # Paramodulations : 8160
% 0.25/1.43 # Factorizations : 20
% 0.25/1.43 # Equation resolutions : 6
% 0.25/1.43 # Current number of processed clauses : 366
% 0.25/1.43 # Positive orientable unit clauses : 117
% 0.25/1.43 # Positive unorientable unit clauses: 4
% 0.25/1.43 # Negative unit clauses : 61
% 0.25/1.43 # Non-unit-clauses : 184
% 0.25/1.43 # Current number of unprocessed clauses: 1721
% 0.25/1.43 # ...number of literals in the above : 6830
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 254
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 8080
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 5107
% 0.25/1.43 # Non-unit clause-clause subsumptions : 269
% 0.25/1.43 # Unit Clause-clause subsumption calls : 2083
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 183
% 0.25/1.43 # BW rewrite match successes : 94
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 97025
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.198 s
% 0.25/1.43 # System time : 0.004 s
% 0.25/1.43 # Total time : 0.202 s
% 0.25/1.43 # Maximum resident set size: 6620 pages
%------------------------------------------------------------------------------