TSTP Solution File: SWV104+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV104+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.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:13 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 59 ( 42 unt; 0 def)
% Number of atoms : 116 ( 95 equ)
% Maximal formula atoms : 12 ( 1 avg)
% Number of connectives : 86 ( 29 ~; 26 |; 27 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-3 aty)
% Number of variables : 46 ( 3 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_inuse_0016,conjecture,
( ( 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_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) = use ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',quaternion_ds1_inuse_0016) ).
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(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(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_2,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_2) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_1) ).
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_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_4,axiom,
succ(succ(succ(succ(n0)))) = n4,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_4) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(successor_5,axiom,
succ(succ(succ(succ(succ(n0))))) = n5,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_5) ).
fof(gt_4_3,axiom,
gt(n4,n3),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_4_3) ).
fof(gt_5_3,axiom,
gt(n5,n3),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_5_3) ).
fof(reflexivity_leq,axiom,
! [X1] : leq(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
fof(c_0_14,negated_conjecture,
~ ( ( 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_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) = use ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_inuse_0016]) ).
fof(c_0_15,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).
fof(c_0_16,negated_conjecture,
( 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_select3(u_defuse,n0,n0) != use
| a_select3(u_defuse,n1,n0) != use
| a_select3(u_defuse,n2,n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use ) ),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X18,X19,X20] : a_select2(tptp_update2(X18,X19,X20),X19) = X20,
inference(variable_rename,[status(thm)],[sel2_update_1]) ).
fof(c_0_18,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_19,plain,
succ(succ(n0)) = n2,
inference(split_conjunct,[status(thm)],[successor_2]) ).
cnf(c_0_20,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_22,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use
| a_select3(u_defuse,n2,n0) != use
| a_select3(u_defuse,n1,n0) != use
| a_select3(u_defuse,n0,n0) != use ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
a_select3(u_defuse,n0,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
a_select2(tptp_update2(X1,X2,X3),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
a_select3(u_defuse,n1,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,negated_conjecture,
a_select3(u_defuse,n2,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
( a_select2(tptp_update2(X1,X2,X3),X4) = X5
| X2 = X4
| a_select2(X1,X4) != X5 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
succ(succ(succ(n0))) = n3,
inference(split_conjunct,[status(thm)],[successor_3]) ).
cnf(c_0_29,plain,
plus(plus(n0,n1),n1) = n2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
cnf(c_0_30,plain,
plus(n0,n1) = n1,
inference(rw,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_31,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),c_0_24]),c_0_25]),c_0_26])]) ).
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_27]) ).
fof(c_0_33,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_34,plain,
succ(succ(succ(succ(n0)))) = n4,
inference(split_conjunct,[status(thm)],[successor_4]) ).
cnf(c_0_35,plain,
plus(plus(plus(n0,n1),n1),n1) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_36,plain,
plus(n1,n1) = n2,
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( n3 = n5
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n3) != use ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
fof(c_0_38,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[irreflexivity_gt])]) ).
cnf(c_0_39,plain,
( gt(X1,X2)
| ~ leq(succ(X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
succ(succ(succ(succ(succ(n0))))) = n5,
inference(split_conjunct,[status(thm)],[successor_5]) ).
cnf(c_0_41,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_34,c_0_20]),c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_42,plain,
plus(n2,n1) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_30]),c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( n4 = n5
| n3 = n5
| a_select2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n3) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_32]),c_0_24])]) ).
cnf(c_0_44,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,plain,
( gt(X1,X2)
| ~ leq(plus(X2,n1),X1) ),
inference(rw,[status(thm)],[c_0_39,c_0_20]) ).
cnf(c_0_46,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_40,c_0_20]),c_0_20]),c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_47,plain,
plus(n3,n1) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_30]),c_0_36]),c_0_42]) ).
cnf(c_0_48,plain,
gt(n4,n3),
inference(split_conjunct,[status(thm)],[gt_4_3]) ).
cnf(c_0_49,negated_conjecture,
( n3 = n4
| n3 = n5
| n4 = n5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_32]),c_0_24])]) ).
cnf(c_0_50,plain,
~ leq(plus(X1,n1),X1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,plain,
plus(n4,n1) = n5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_30]),c_0_36]),c_0_42]),c_0_47]) ).
cnf(c_0_52,plain,
gt(n5,n3),
inference(split_conjunct,[status(thm)],[gt_5_3]) ).
cnf(c_0_53,negated_conjecture,
( n4 = n5
| n3 = n5 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_44]) ).
fof(c_0_54,plain,
! [X2] : leq(X2,X2),
inference(variable_rename,[status(thm)],[reflexivity_leq]) ).
cnf(c_0_55,plain,
~ leq(n5,n4),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
n4 = n5,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_44]) ).
cnf(c_0_57,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_58,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV104+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 21:27:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.019 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 59
% 0.23/1.42 # Proof object clause steps : 37
% 0.23/1.42 # Proof object formula steps : 22
% 0.23/1.42 # Proof object conjectures : 13
% 0.23/1.42 # Proof object clause conjectures : 10
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 17
% 0.23/1.42 # Proof object initial formulas used : 14
% 0.23/1.42 # Proof object generating inferences : 8
% 0.23/1.42 # Proof object simplifying inferences : 41
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 85
% 0.23/1.42 # Removed by relevancy pruning/SinE : 26
% 0.23/1.42 # Initial clauses : 69
% 0.23/1.42 # Removed in clause preprocessing : 1
% 0.23/1.42 # Initial clauses in saturation : 68
% 0.23/1.42 # Processed clauses : 182
% 0.23/1.42 # ...of these trivial : 9
% 0.23/1.42 # ...subsumed : 15
% 0.23/1.42 # ...remaining for further processing : 158
% 0.23/1.42 # Other redundant clauses eliminated : 1
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 2
% 0.23/1.42 # Backward-rewritten : 46
% 0.23/1.42 # Generated clauses : 474
% 0.23/1.42 # ...of the previous two non-trivial : 364
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 469
% 0.23/1.42 # Factorizations : 3
% 0.23/1.42 # Equation resolutions : 2
% 0.23/1.42 # Current number of processed clauses : 110
% 0.23/1.42 # Positive orientable unit clauses : 54
% 0.23/1.42 # Positive unorientable unit clauses: 2
% 0.23/1.42 # Negative unit clauses : 23
% 0.23/1.42 # Non-unit-clauses : 31
% 0.23/1.42 # Current number of unprocessed clauses: 156
% 0.23/1.42 # ...number of literals in the above : 358
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 49
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 93
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 39
% 0.23/1.42 # Non-unit clause-clause subsumptions : 2
% 0.23/1.42 # Unit Clause-clause subsumption calls : 236
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 12
% 0.23/1.42 # BW rewrite match successes : 10
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 7801
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.031 s
% 0.23/1.42 # System time : 0.001 s
% 0.23/1.42 # Total time : 0.032 s
% 0.23/1.42 # Maximum resident set size: 3700 pages
%------------------------------------------------------------------------------