TSTP Solution File: SWV222+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV222+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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:38 EDT 2022
% Result : Theorem 0.26s 1.45s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 3 unt; 0 def)
% Number of atoms : 389 ( 308 equ)
% Maximal formula atoms : 113 ( 27 avg)
% Number of connectives : 599 ( 224 ~; 79 |; 283 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 44 ( 15 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-3 aty)
% Number of variables : 28 ( 5 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0441,conjecture,
( ( ! [X14,X18] :
( ( leq(n0,X14)
& leq(n0,X18)
& leq(X14,n5)
& leq(X18,n5) )
=> a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) )
& ! [X4,X20] :
( ( leq(n0,X4)
& leq(n0,X20)
& leq(X4,n2)
& leq(X20,n2) )
=> a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) ) )
=> ! [X21,X22] :
( ( leq(n0,X21)
& leq(n0,X22)
& leq(X21,n5)
& leq(X22,n5) )
=> ( ( ~ ( n0 = X21
& n1 = X22 )
& ~ ( n0 = X21
& n2 = X22 )
& ~ ( n0 = X21
& n3 = X22 )
& ~ ( n0 = X21
& n4 = X22 )
& ~ ( n0 = X21
& n5 = X22 )
& ~ ( n0 = X22
& n1 = X21 )
& ~ ( n0 = X22
& n2 = X21 )
& ~ ( n0 = X22
& n3 = X21 )
& ~ ( n0 = X22
& n4 = X21 )
& ~ ( n0 = X22
& n5 = X21 )
& ~ ( n1 = X21
& n1 = X22 )
& ~ ( n1 = X21
& n2 = X22 )
& ~ ( n1 = X21
& n3 = X22 )
& ~ ( n1 = X21
& n4 = X22 )
& ~ ( n1 = X21
& n5 = X22 )
& ~ ( n1 = X22
& n2 = X21 )
& ~ ( n1 = X22
& n3 = X21 )
& ~ ( n1 = X22
& n4 = X21 )
& ~ ( n1 = X22
& n5 = X21 )
& ~ ( n2 = X21
& n2 = X22 )
& ~ ( n2 = X21
& n3 = X22 )
& ~ ( n2 = X21
& n4 = X22 )
& ~ ( n2 = X21
& n5 = X22 )
& ~ ( n2 = X22
& n3 = X21 )
& ~ ( n2 = X22
& n4 = X21 )
& ~ ( n2 = X22
& n5 = X21 )
& ~ ( n3 = X21
& n3 = X22 )
& ~ ( n3 = X21
& n4 = X22 )
& ~ ( n3 = X21
& n5 = X22 )
& ~ ( n3 = X22
& n4 = X21 )
& ~ ( n3 = X22
& n5 = X21 )
& ~ ( n4 = X21
& n4 = X22 )
& ~ ( n4 = X21
& n5 = X22 )
& ~ ( n4 = X22
& n5 = X21 )
& ~ ( n5 = X21
& n5 = X22 )
& n0 = X21
& n0 = X22
& n1 = X21
& n3 = X22 )
=> a_select2(xinit_noise,n0) = n0 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',quaternion_ds1_symm_0441) ).
fof(c_0_1,plain,
! [X21,X22] :
( epred2_2(X22,X21)
<=> ( ~ ( n0 = X21
& n1 = X22 )
& ~ ( n0 = X21
& n2 = X22 )
& ~ ( n0 = X21
& n3 = X22 )
& ~ ( n0 = X21
& n4 = X22 )
& ~ ( n0 = X21
& n5 = X22 )
& ~ ( n0 = X22
& n1 = X21 )
& ~ ( n0 = X22
& n2 = X21 )
& ~ ( n0 = X22
& n3 = X21 )
& ~ ( n0 = X22
& n4 = X21 )
& ~ ( n0 = X22
& n5 = X21 )
& ~ ( n1 = X21
& n1 = X22 )
& ~ ( n1 = X21
& n2 = X22 )
& ~ ( n1 = X21
& n3 = X22 )
& ~ ( n1 = X21
& n4 = X22 )
& ~ ( n1 = X21
& n5 = X22 )
& ~ ( n1 = X22
& n2 = X21 )
& ~ ( n1 = X22
& n3 = X21 )
& ~ ( n1 = X22
& n4 = X21 )
& ~ ( n1 = X22
& n5 = X21 )
& ~ ( n2 = X21
& n2 = X22 )
& ~ ( n2 = X21
& n3 = X22 )
& ~ ( n2 = X21
& n4 = X22 )
& ~ ( n2 = X21
& n5 = X22 )
& ~ ( n2 = X22
& n3 = X21 )
& ~ ( n2 = X22
& n4 = X21 )
& ~ ( n2 = X22
& n5 = X21 )
& ~ ( n3 = X21
& n3 = X22 )
& ~ ( n3 = X21
& n4 = X22 )
& ~ ( n3 = X21
& n5 = X22 )
& ~ ( n3 = X22
& n4 = X21 )
& ~ ( n3 = X22
& n5 = X21 )
& ~ ( n4 = X21
& n4 = X22 )
& ~ ( n4 = X21
& n5 = X22 )
& ~ ( n4 = X22
& n5 = X21 )
& ~ ( n5 = X21
& n5 = X22 )
& n0 = X21
& n0 = X22
& n1 = X21
& n3 = X22 ) ),
introduced(definition) ).
fof(c_0_2,plain,
! [X21,X22] :
( epred2_2(X22,X21)
=> ( ~ ( n0 = X21
& n1 = X22 )
& ~ ( n0 = X21
& n2 = X22 )
& ~ ( n0 = X21
& n3 = X22 )
& ~ ( n0 = X21
& n4 = X22 )
& ~ ( n0 = X21
& n5 = X22 )
& ~ ( n0 = X22
& n1 = X21 )
& ~ ( n0 = X22
& n2 = X21 )
& ~ ( n0 = X22
& n3 = X21 )
& ~ ( n0 = X22
& n4 = X21 )
& ~ ( n0 = X22
& n5 = X21 )
& ~ ( n1 = X21
& n1 = X22 )
& ~ ( n1 = X21
& n2 = X22 )
& ~ ( n1 = X21
& n3 = X22 )
& ~ ( n1 = X21
& n4 = X22 )
& ~ ( n1 = X21
& n5 = X22 )
& ~ ( n1 = X22
& n2 = X21 )
& ~ ( n1 = X22
& n3 = X21 )
& ~ ( n1 = X22
& n4 = X21 )
& ~ ( n1 = X22
& n5 = X21 )
& ~ ( n2 = X21
& n2 = X22 )
& ~ ( n2 = X21
& n3 = X22 )
& ~ ( n2 = X21
& n4 = X22 )
& ~ ( n2 = X21
& n5 = X22 )
& ~ ( n2 = X22
& n3 = X21 )
& ~ ( n2 = X22
& n4 = X21 )
& ~ ( n2 = X22
& n5 = X21 )
& ~ ( n3 = X21
& n3 = X22 )
& ~ ( n3 = X21
& n4 = X22 )
& ~ ( n3 = X21
& n5 = X22 )
& ~ ( n3 = X22
& n4 = X21 )
& ~ ( n3 = X22
& n5 = X21 )
& ~ ( n4 = X21
& n4 = X22 )
& ~ ( n4 = X21
& n5 = X22 )
& ~ ( n4 = X22
& n5 = X21 )
& ~ ( n5 = X21
& n5 = X22 )
& n0 = X21
& n0 = X22
& n1 = X21
& n3 = X22 ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,plain,
( epred1_0
<=> ( ! [X14,X18] :
( ( leq(n0,X14)
& leq(n0,X18)
& leq(X14,n5)
& leq(X18,n5) )
=> a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) )
& ! [X4,X20] :
( ( leq(n0,X4)
& leq(n0,X20)
& leq(X4,n2)
& leq(X20,n2) )
=> a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) ) ) ),
introduced(definition) ).
fof(c_0_4,plain,
! [X23,X24] :
( ( n0 != X23
| n1 != X24
| ~ epred2_2(X24,X23) )
& ( n0 != X23
| n2 != X24
| ~ epred2_2(X24,X23) )
& ( n0 != X23
| n3 != X24
| ~ epred2_2(X24,X23) )
& ( n0 != X23
| n4 != X24
| ~ epred2_2(X24,X23) )
& ( n0 != X23
| n5 != X24
| ~ epred2_2(X24,X23) )
& ( n0 != X24
| n1 != X23
| ~ epred2_2(X24,X23) )
& ( n0 != X24
| n2 != X23
| ~ epred2_2(X24,X23) )
& ( n0 != X24
| n3 != X23
| ~ epred2_2(X24,X23) )
& ( n0 != X24
| n4 != X23
| ~ epred2_2(X24,X23) )
& ( n0 != X24
| n5 != X23
| ~ epred2_2(X24,X23) )
& ( n1 != X23
| n1 != X24
| ~ epred2_2(X24,X23) )
& ( n1 != X23
| n2 != X24
| ~ epred2_2(X24,X23) )
& ( n1 != X23
| n3 != X24
| ~ epred2_2(X24,X23) )
& ( n1 != X23
| n4 != X24
| ~ epred2_2(X24,X23) )
& ( n1 != X23
| n5 != X24
| ~ epred2_2(X24,X23) )
& ( n1 != X24
| n2 != X23
| ~ epred2_2(X24,X23) )
& ( n1 != X24
| n3 != X23
| ~ epred2_2(X24,X23) )
& ( n1 != X24
| n4 != X23
| ~ epred2_2(X24,X23) )
& ( n1 != X24
| n5 != X23
| ~ epred2_2(X24,X23) )
& ( n2 != X23
| n2 != X24
| ~ epred2_2(X24,X23) )
& ( n2 != X23
| n3 != X24
| ~ epred2_2(X24,X23) )
& ( n2 != X23
| n4 != X24
| ~ epred2_2(X24,X23) )
& ( n2 != X23
| n5 != X24
| ~ epred2_2(X24,X23) )
& ( n2 != X24
| n3 != X23
| ~ epred2_2(X24,X23) )
& ( n2 != X24
| n4 != X23
| ~ epred2_2(X24,X23) )
& ( n2 != X24
| n5 != X23
| ~ epred2_2(X24,X23) )
& ( n3 != X23
| n3 != X24
| ~ epred2_2(X24,X23) )
& ( n3 != X23
| n4 != X24
| ~ epred2_2(X24,X23) )
& ( n3 != X23
| n5 != X24
| ~ epred2_2(X24,X23) )
& ( n3 != X24
| n4 != X23
| ~ epred2_2(X24,X23) )
& ( n3 != X24
| n5 != X23
| ~ epred2_2(X24,X23) )
& ( n4 != X23
| n4 != X24
| ~ epred2_2(X24,X23) )
& ( n4 != X23
| n5 != X24
| ~ epred2_2(X24,X23) )
& ( n4 != X24
| n5 != X23
| ~ epred2_2(X24,X23) )
& ( n5 != X23
| n5 != X24
| ~ epred2_2(X24,X23) )
& ( n0 = X23
| ~ epred2_2(X24,X23) )
& ( n0 = X24
| ~ epred2_2(X24,X23) )
& ( n1 = X23
| ~ epred2_2(X24,X23) )
& ( n3 = X24
| ~ epred2_2(X24,X23) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_5,negated_conjecture,
~ ( epred1_0
=> ! [X21,X22] :
( ( leq(n0,X21)
& leq(n0,X22)
& leq(X21,n5)
& leq(X22,n5) )
=> ( epred2_2(X22,X21)
=> a_select2(xinit_noise,n0) = n0 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0441]),c_0_3]),c_0_1]) ).
cnf(c_0_6,plain,
( ~ epred2_2(X1,X2)
| n3 != X1
| n0 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( n0 = X2
| ~ epred2_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( epred1_0
& leq(n0,esk1_0)
& leq(n0,esk2_0)
& leq(esk1_0,n5)
& leq(esk2_0,n5)
& epred2_2(esk2_0,esk1_0)
& a_select2(xinit_noise,n0) != n0 ),
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_5])])])])]) ).
cnf(c_0_9,plain,
( n3 = X1
| ~ epred2_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( n3 != X1
| ~ epred2_2(X1,X2) ),
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
epred2_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
~ epred2_2(X1,X2),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV222+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.14/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jun 15 05:44:37 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.26/1.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.45 # Preprocessing time : 0.020 s
% 0.26/1.45
% 0.26/1.45 # Proof found!
% 0.26/1.45 # SZS status Theorem
% 0.26/1.45 # SZS output start CNFRefutation
% See solution above
% 0.26/1.45 # Proof object total steps : 14
% 0.26/1.45 # Proof object clause steps : 7
% 0.26/1.45 # Proof object formula steps : 7
% 0.26/1.45 # Proof object conjectures : 5
% 0.26/1.45 # Proof object clause conjectures : 2
% 0.26/1.45 # Proof object formula conjectures : 3
% 0.26/1.45 # Proof object initial clauses used : 4
% 0.26/1.45 # Proof object initial formulas used : 1
% 0.26/1.45 # Proof object generating inferences : 0
% 0.26/1.45 # Proof object simplifying inferences : 3
% 0.26/1.45 # Training examples: 0 positive, 0 negative
% 0.26/1.45 # Parsed axioms : 85
% 0.26/1.45 # Removed by relevancy pruning/SinE : 29
% 0.26/1.45 # Initial clauses : 105
% 0.26/1.45 # Removed in clause preprocessing : 1
% 0.26/1.45 # Initial clauses in saturation : 104
% 0.26/1.45 # Processed clauses : 46
% 0.26/1.45 # ...of these trivial : 0
% 0.26/1.45 # ...subsumed : 0
% 0.26/1.45 # ...remaining for further processing : 46
% 0.26/1.45 # Other redundant clauses eliminated : 0
% 0.26/1.45 # Clauses deleted for lack of memory : 0
% 0.26/1.45 # Backward-subsumed : 0
% 0.26/1.45 # Backward-rewritten : 0
% 0.26/1.45 # Generated clauses : 40
% 0.26/1.45 # ...of the previous two non-trivial : 34
% 0.26/1.45 # Contextual simplify-reflections : 6
% 0.26/1.45 # Paramodulations : 39
% 0.26/1.45 # Factorizations : 0
% 0.26/1.45 # Equation resolutions : 0
% 0.26/1.45 # Current number of processed clauses : 45
% 0.26/1.45 # Positive orientable unit clauses : 32
% 0.26/1.45 # Positive unorientable unit clauses: 0
% 0.26/1.45 # Negative unit clauses : 3
% 0.26/1.45 # Non-unit-clauses : 10
% 0.26/1.45 # Current number of unprocessed clauses: 84
% 0.26/1.45 # ...number of literals in the above : 218
% 0.26/1.45 # Current number of archived formulas : 0
% 0.26/1.45 # Current number of archived clauses : 2
% 0.26/1.45 # Clause-clause subsumption calls (NU) : 14
% 0.26/1.45 # Rec. Clause-clause subsumption calls : 14
% 0.26/1.45 # Non-unit clause-clause subsumptions : 6
% 0.26/1.45 # Unit Clause-clause subsumption calls : 16
% 0.26/1.45 # Rewrite failures with RHS unbound : 0
% 0.26/1.45 # BW rewrite match attempts : 4
% 0.26/1.45 # BW rewrite match successes : 0
% 0.26/1.45 # Condensation attempts : 0
% 0.26/1.45 # Condensation successes : 0
% 0.26/1.45 # Termbank termtop insertions : 5260
% 0.26/1.45
% 0.26/1.45 # -------------------------------------------------
% 0.26/1.45 # User time : 0.017 s
% 0.26/1.45 # System time : 0.005 s
% 0.26/1.45 # Total time : 0.022 s
% 0.26/1.45 # Maximum resident set size: 3232 pages
%------------------------------------------------------------------------------