TSTP Solution File: SWV232+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV232+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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:40 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 3 unt; 0 def)
% Number of atoms : 129 ( 83 equ)
% Maximal formula atoms : 29 ( 9 avg)
% Number of connectives : 176 ( 60 ~; 27 |; 79 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 26 ( 5 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0841,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) )
=> ( ( ~ ( n0 = X4
& n1 = X20 )
& ~ ( n0 = X4
& n2 = X20 )
& ~ ( n0 = X20
& n2 = X4 )
& ~ ( n1 = X4
& n1 = X20 )
& ~ ( n1 = X4
& n2 = X20 )
& ~ ( n1 = X20
& n2 = X4 )
& ~ ( n2 = X4
& n2 = X20 )
& n0 = X20
& n1 = X4
& n1 = X20
& n2 = X4 )
=> a_select2(rho,n1) = n0 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',quaternion_ds1_symm_0841) ).
fof(c_0_1,plain,
! [X20,X4] :
( epred1_2(X4,X20)
<=> ( ~ ( n0 = X4
& n1 = X20 )
& ~ ( n0 = X4
& n2 = X20 )
& ~ ( n0 = X20
& n2 = X4 )
& ~ ( n1 = X4
& n1 = X20 )
& ~ ( n1 = X4
& n2 = X20 )
& ~ ( n1 = X20
& n2 = X4 )
& ~ ( n2 = X4
& n2 = X20 )
& n0 = X20
& n1 = X4
& n1 = X20
& n2 = X4 ) ),
introduced(definition) ).
fof(c_0_2,plain,
! [X20,X4] :
( epred1_2(X4,X20)
=> ( ~ ( n0 = X4
& n1 = X20 )
& ~ ( n0 = X4
& n2 = X20 )
& ~ ( n0 = X20
& n2 = X4 )
& ~ ( n1 = X4
& n1 = X20 )
& ~ ( n1 = X4
& n2 = X20 )
& ~ ( n1 = X20
& n2 = X4 )
& ~ ( n2 = X4
& n2 = X20 )
& n0 = X20
& n1 = X4
& n1 = X20
& n2 = X4 ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,plain,
! [X21,X22] :
( ( n0 != X22
| n1 != X21
| ~ epred1_2(X22,X21) )
& ( n0 != X22
| n2 != X21
| ~ epred1_2(X22,X21) )
& ( n0 != X21
| n2 != X22
| ~ epred1_2(X22,X21) )
& ( n1 != X22
| n1 != X21
| ~ epred1_2(X22,X21) )
& ( n1 != X22
| n2 != X21
| ~ epred1_2(X22,X21) )
& ( n1 != X21
| n2 != X22
| ~ epred1_2(X22,X21) )
& ( n2 != X22
| n2 != X21
| ~ epred1_2(X22,X21) )
& ( n0 = X21
| ~ epred1_2(X22,X21) )
& ( n1 = X22
| ~ epred1_2(X22,X21) )
& ( n1 = X21
| ~ epred1_2(X22,X21) )
& ( n2 = X22
| ~ epred1_2(X22,X21) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,negated_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) )
=> ( epred1_2(X4,X20)
=> a_select2(rho,n1) = n0 ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0841]),c_0_1]) ).
cnf(c_0_5,plain,
( ~ epred1_2(X1,X2)
| n2 != X1
| n0 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( n0 = X2
| ~ epred1_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_7,negated_conjecture,
! [X21,X22] :
( ( ~ leq(n0,X21)
| ~ leq(n0,X22)
| ~ leq(X21,n5)
| ~ leq(X22,n5)
| a_select3(q_ds1_filter,X21,X22) = a_select3(q_ds1_filter,X22,X21) )
& leq(n0,esk1_0)
& leq(n0,esk2_0)
& leq(esk1_0,n2)
& leq(esk2_0,n2)
& epred1_2(esk1_0,esk2_0)
& a_select2(rho,n1) != n0 ),
inference(shift_quantors,[status(thm)],[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_4])])])])])]) ).
cnf(c_0_8,plain,
( n2 = X1
| ~ epred1_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,plain,
( n2 != X1
| ~ epred1_2(X1,X2) ),
inference(csr,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,negated_conjecture,
epred1_2(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
~ epred1_2(X1,X2),
inference(csr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_10,c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV232+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 01:58:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.018 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 13
% 0.24/1.42 # Proof object clause steps : 7
% 0.24/1.42 # Proof object formula steps : 6
% 0.24/1.42 # Proof object conjectures : 5
% 0.24/1.42 # Proof object clause conjectures : 2
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 4
% 0.24/1.42 # Proof object initial formulas used : 1
% 0.24/1.42 # Proof object generating inferences : 0
% 0.24/1.42 # Proof object simplifying inferences : 3
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 85
% 0.24/1.42 # Removed by relevancy pruning/SinE : 29
% 0.24/1.42 # Initial clauses : 75
% 0.24/1.42 # Removed in clause preprocessing : 1
% 0.24/1.42 # Initial clauses in saturation : 74
% 0.24/1.42 # Processed clauses : 46
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 1
% 0.24/1.42 # ...remaining for further processing : 45
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 0
% 0.24/1.42 # Generated clauses : 59
% 0.24/1.42 # ...of the previous two non-trivial : 53
% 0.24/1.42 # Contextual simplify-reflections : 4
% 0.24/1.42 # Paramodulations : 58
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 44
% 0.24/1.42 # Positive orientable unit clauses : 31
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 3
% 0.24/1.42 # Non-unit-clauses : 10
% 0.24/1.42 # Current number of unprocessed clauses: 76
% 0.24/1.42 # ...number of literals in the above : 145
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 2
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 12
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 11
% 0.24/1.42 # Non-unit clause-clause subsumptions : 5
% 0.24/1.42 # Unit Clause-clause subsumption calls : 11
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 0
% 0.24/1.42 # BW rewrite match successes : 0
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 4250
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.016 s
% 0.24/1.42 # System time : 0.004 s
% 0.24/1.42 # Total time : 0.020 s
% 0.24/1.42 # Maximum resident set size: 3184 pages
%------------------------------------------------------------------------------