TSTP Solution File: SWV102+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV102+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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:12 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 54 ( 33 unt; 0 def)
% Number of atoms : 179 ( 154 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 186 ( 61 ~; 57 |; 63 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 11 con; 0-3 aty)
% Number of variables : 49 ( 3 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_inuse_0014,conjecture,
( ( 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(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(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n2) = use ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',quaternion_ds1_inuse_0014) ).
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(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(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(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_1) ).
fof(gt_1_0,axiom,
gt(n1,n0),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_1_0) ).
fof(leq_gt1,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(gt_2_1,axiom,
gt(n2,n1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_2_1) ).
fof(c_0_10,negated_conjecture,
~ ( ( 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(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(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n2) = use ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_inuse_0014]) ).
fof(c_0_11,negated_conjecture,
( 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(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(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n2) != use ) ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
cnf(c_0_12,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n2) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) != use
| a_select2(xinit_defuse,n5) != use
| a_select2(xinit_defuse,n4) != use
| a_select2(xinit_defuse,n3) != use
| a_select3(u_defuse,n2,n0) != use
| a_select3(u_defuse,n1,n0) != use
| a_select3(u_defuse,n0,n0) != use
| a_select2(sigma_defuse,n5) != use
| a_select2(sigma_defuse,n4) != use
| a_select2(sigma_defuse,n3) != use
| a_select2(sigma_defuse,n2) != use
| a_select2(sigma_defuse,n1) != use
| a_select2(sigma_defuse,n0) != use ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_13,negated_conjecture,
a_select2(sigma_defuse,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
a_select2(sigma_defuse,n1) = use,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X18,X19,X20] : a_select2(tptp_update2(X18,X19,X20),X19) = X20,
inference(variable_rename,[status(thm)],[sel2_update_1]) ).
fof(c_0_16,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_17,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n2) != use
| a_select3(u_defuse,n0,n0) != use
| a_select3(u_defuse,n1,n0) != use
| a_select3(u_defuse,n2,n0) != 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_select2(xinit_defuse,n3) != use
| a_select2(xinit_defuse,n4) != use
| a_select2(xinit_defuse,n5) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_18,negated_conjecture,
a_select2(sigma_defuse,n2) = use,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
a_select2(tptp_update2(X1,X2,X3),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
a_select3(u_defuse,n0,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
a_select3(u_defuse,n1,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,negated_conjecture,
a_select3(u_defuse,n2,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
a_select2(sigma_defuse,n3) = use,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,negated_conjecture,
a_select2(sigma_defuse,n4) = use,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,negated_conjecture,
a_select2(sigma_defuse,n5) = use,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,negated_conjecture,
a_select2(xinit_defuse,n3) = use,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,negated_conjecture,
a_select2(xinit_defuse,n4) = use,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,negated_conjecture,
a_select2(xinit_defuse,n5) = use,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,plain,
( a_select2(tptp_update2(X1,X2,X3),X4) = X5
| X2 = X4
| a_select2(X1,X4) != X5 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_30,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n1) != use ),
inference(cn,[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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),c_0_19]),c_0_20]),c_0_21]),c_0_22]),c_0_23]),c_0_24]),c_0_25]),c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_31,plain,
( a_select2(tptp_update2(X1,X2,X3),X4) = a_select2(X1,X4)
| X2 = X4 ),
inference(er,[status(thm)],[c_0_29]) ).
fof(c_0_32,plain,
! [X3,X4] :
( ~ leq(succ(X3),X4)
| gt(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt])]) ).
fof(c_0_33,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).
cnf(c_0_34,negated_conjecture,
( n1 = n2
| a_select2(tptp_update2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n2,use),n0) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_19])]) ).
fof(c_0_35,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[irreflexivity_gt])]) ).
cnf(c_0_36,plain,
( gt(X1,X2)
| ~ leq(succ(X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( n0 = n2
| n1 = n2
| a_select2(tptp_update2(tptp_update2(rho_defuse,n0,use),n1,use),n0) != use ),
inference(spm,[status(thm)],[c_0_34,c_0_31]) ).
cnf(c_0_39,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
( gt(X1,X2)
| ~ leq(plus(X2,n1),X1) ),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_42,plain,
gt(n1,n0),
inference(split_conjunct,[status(thm)],[gt_1_0]) ).
cnf(c_0_43,negated_conjecture,
( n1 = n0
| n1 = n2
| n0 = n2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_31]),c_0_19])]) ).
fof(c_0_44,plain,
! [X3,X4] :
( ~ gt(X4,X3)
| leq(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])]) ).
cnf(c_0_45,plain,
~ leq(plus(X1,n1),X1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
plus(n0,n1) = n1,
inference(rw,[status(thm)],[c_0_41,c_0_37]) ).
cnf(c_0_47,plain,
gt(n2,n1),
inference(split_conjunct,[status(thm)],[gt_2_1]) ).
cnf(c_0_48,negated_conjecture,
( n0 = n2
| n1 = n2 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_39]) ).
cnf(c_0_49,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,plain,
~ leq(n1,n0),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
n0 = n2,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_39]) ).
cnf(c_0_52,plain,
leq(n1,n2),
inference(spm,[status(thm)],[c_0_49,c_0_47]) ).
cnf(c_0_53,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV102+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 15 16:37:55 EDT 2022
% 0.14/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.019 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 : 54
% 0.25/1.43 # Proof object clause steps : 36
% 0.25/1.43 # Proof object formula steps : 18
% 0.25/1.43 # Proof object conjectures : 23
% 0.25/1.43 # Proof object clause conjectures : 20
% 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 : 10
% 0.25/1.43 # Proof object generating inferences : 9
% 0.25/1.43 # Proof object simplifying inferences : 27
% 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 : 26
% 0.25/1.43 # Initial clauses : 75
% 0.25/1.43 # Removed in clause preprocessing : 1
% 0.25/1.43 # Initial clauses in saturation : 74
% 0.25/1.43 # Processed clauses : 180
% 0.25/1.43 # ...of these trivial : 7
% 0.25/1.43 # ...subsumed : 15
% 0.25/1.43 # ...remaining for further processing : 158
% 0.25/1.43 # Other redundant clauses eliminated : 1
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 2
% 0.25/1.43 # Backward-rewritten : 48
% 0.25/1.43 # Generated clauses : 525
% 0.25/1.43 # ...of the previous two non-trivial : 400
% 0.25/1.43 # Contextual simplify-reflections : 15
% 0.25/1.43 # Paramodulations : 520
% 0.25/1.43 # Factorizations : 3
% 0.25/1.43 # Equation resolutions : 2
% 0.25/1.43 # Current number of processed clauses : 108
% 0.25/1.43 # Positive orientable unit clauses : 63
% 0.25/1.43 # Positive unorientable unit clauses: 5
% 0.25/1.43 # Negative unit clauses : 15
% 0.25/1.43 # Non-unit-clauses : 25
% 0.25/1.43 # Current number of unprocessed clauses: 158
% 0.25/1.43 # ...number of literals in the above : 335
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 51
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 151
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 115
% 0.25/1.43 # Non-unit clause-clause subsumptions : 18
% 0.25/1.43 # Unit Clause-clause subsumption calls : 288
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 14
% 0.25/1.43 # BW rewrite match successes : 12
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 8560
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.033 s
% 0.25/1.43 # System time : 0.003 s
% 0.25/1.43 # Total time : 0.036 s
% 0.25/1.43 # Maximum resident set size: 3712 pages
%------------------------------------------------------------------------------