TSTP Solution File: ALG025+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : ALG025+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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 : Thu Jul 14 16:47:18 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 16 unt; 0 def)
% Number of atoms : 283 ( 276 equ)
% Maximal formula atoms : 72 ( 13 avg)
% Number of connectives : 346 ( 84 ~; 86 |; 176 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
( ( op(e0,e0) = op(e0,e0)
& op(e0,e1) = op(e1,e0)
& op(e0,e2) = op(e2,e0)
& op(e0,e3) = op(e3,e0)
& op(e0,e4) = op(e4,e0)
& op(e0,e5) = op(e5,e0)
& op(e1,e0) = op(e0,e1)
& op(e1,e1) = op(e1,e1)
& op(e1,e2) = op(e2,e1)
& op(e1,e3) = op(e3,e1)
& op(e1,e4) = op(e4,e1)
& op(e1,e5) = op(e5,e1)
& op(e2,e0) = op(e0,e2)
& op(e2,e1) = op(e1,e2)
& op(e2,e2) = op(e2,e2)
& op(e2,e3) = op(e3,e2)
& op(e2,e4) = op(e4,e2)
& op(e2,e5) = op(e5,e2)
& op(e3,e0) = op(e0,e3)
& op(e3,e1) = op(e1,e3)
& op(e3,e2) = op(e2,e3)
& op(e3,e3) = op(e3,e3)
& op(e3,e4) = op(e4,e3)
& op(e3,e5) = op(e5,e3)
& op(e4,e0) = op(e0,e4)
& op(e4,e1) = op(e1,e4)
& op(e4,e2) = op(e2,e4)
& op(e4,e3) = op(e3,e4)
& op(e4,e4) = op(e4,e4)
& op(e4,e5) = op(e5,e4)
& op(e5,e0) = op(e0,e5)
& op(e5,e1) = op(e1,e5)
& op(e5,e2) = op(e2,e5)
& op(e5,e3) = op(e3,e5)
& op(e5,e4) = op(e4,e5)
& op(e5,e5) = op(e5,e5) )
| ~ ( op(e0,e0) = op(e0,e0)
& op(e0,e1) = op(e1,e0)
& op(e0,e2) = op(e2,e0)
& op(e0,e3) = op(e3,e0)
& op(e0,e4) = op(e4,e0)
& op(e0,e5) = op(e5,e0)
& op(e1,e0) = op(e0,e1)
& op(e1,e1) = op(e1,e1)
& op(e1,e2) = op(e2,e1)
& op(e1,e3) = op(e3,e1)
& op(e1,e4) = op(e4,e1)
& op(e1,e5) = op(e5,e1)
& op(e2,e0) = op(e0,e2)
& op(e2,e1) = op(e1,e2)
& op(e2,e2) = op(e2,e2)
& op(e2,e3) = op(e3,e2)
& op(e2,e4) = op(e4,e2)
& op(e2,e5) = op(e5,e2)
& op(e3,e0) = op(e0,e3)
& op(e3,e1) = op(e1,e3)
& op(e3,e2) = op(e2,e3)
& op(e3,e3) = op(e3,e3)
& op(e3,e4) = op(e4,e3)
& op(e3,e5) = op(e5,e3)
& op(e4,e0) = op(e0,e4)
& op(e4,e1) = op(e1,e4)
& op(e4,e2) = op(e2,e4)
& op(e4,e3) = op(e3,e4)
& op(e4,e4) = op(e4,e4)
& op(e4,e5) = op(e5,e4)
& op(e5,e0) = op(e0,e5)
& op(e5,e1) = op(e1,e5)
& op(e5,e2) = op(e2,e5)
& op(e5,e3) = op(e3,e5)
& op(e5,e4) = op(e4,e5)
& op(e5,e5) = op(e5,e5) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(c_0_1,negated_conjecture,
~ ( ( op(e0,e0) = op(e0,e0)
& op(e0,e1) = op(e1,e0)
& op(e0,e2) = op(e2,e0)
& op(e0,e3) = op(e3,e0)
& op(e0,e4) = op(e4,e0)
& op(e0,e5) = op(e5,e0)
& op(e1,e0) = op(e0,e1)
& op(e1,e1) = op(e1,e1)
& op(e1,e2) = op(e2,e1)
& op(e1,e3) = op(e3,e1)
& op(e1,e4) = op(e4,e1)
& op(e1,e5) = op(e5,e1)
& op(e2,e0) = op(e0,e2)
& op(e2,e1) = op(e1,e2)
& op(e2,e2) = op(e2,e2)
& op(e2,e3) = op(e3,e2)
& op(e2,e4) = op(e4,e2)
& op(e2,e5) = op(e5,e2)
& op(e3,e0) = op(e0,e3)
& op(e3,e1) = op(e1,e3)
& op(e3,e2) = op(e2,e3)
& op(e3,e3) = op(e3,e3)
& op(e3,e4) = op(e4,e3)
& op(e3,e5) = op(e5,e3)
& op(e4,e0) = op(e0,e4)
& op(e4,e1) = op(e1,e4)
& op(e4,e2) = op(e2,e4)
& op(e4,e3) = op(e3,e4)
& op(e4,e4) = op(e4,e4)
& op(e4,e5) = op(e5,e4)
& op(e5,e0) = op(e0,e5)
& op(e5,e1) = op(e1,e5)
& op(e5,e2) = op(e2,e5)
& op(e5,e3) = op(e3,e5)
& op(e5,e4) = op(e4,e5)
& op(e5,e5) = op(e5,e5) )
| ~ ( op(e0,e0) = op(e0,e0)
& op(e0,e1) = op(e1,e0)
& op(e0,e2) = op(e2,e0)
& op(e0,e3) = op(e3,e0)
& op(e0,e4) = op(e4,e0)
& op(e0,e5) = op(e5,e0)
& op(e1,e0) = op(e0,e1)
& op(e1,e1) = op(e1,e1)
& op(e1,e2) = op(e2,e1)
& op(e1,e3) = op(e3,e1)
& op(e1,e4) = op(e4,e1)
& op(e1,e5) = op(e5,e1)
& op(e2,e0) = op(e0,e2)
& op(e2,e1) = op(e1,e2)
& op(e2,e2) = op(e2,e2)
& op(e2,e3) = op(e3,e2)
& op(e2,e4) = op(e4,e2)
& op(e2,e5) = op(e5,e2)
& op(e3,e0) = op(e0,e3)
& op(e3,e1) = op(e1,e3)
& op(e3,e2) = op(e2,e3)
& op(e3,e3) = op(e3,e3)
& op(e3,e4) = op(e4,e3)
& op(e3,e5) = op(e5,e3)
& op(e4,e0) = op(e0,e4)
& op(e4,e1) = op(e1,e4)
& op(e4,e2) = op(e2,e4)
& op(e4,e3) = op(e3,e4)
& op(e4,e4) = op(e4,e4)
& op(e4,e5) = op(e5,e4)
& op(e5,e0) = op(e0,e5)
& op(e5,e1) = op(e1,e5)
& op(e5,e2) = op(e2,e5)
& op(e5,e3) = op(e3,e5)
& op(e5,e4) = op(e4,e5)
& op(e5,e5) = op(e5,e5) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_2,negated_conjecture,
( ( op(e0,e0) != op(e0,e0)
| op(e0,e1) != op(e1,e0)
| op(e0,e2) != op(e2,e0)
| op(e0,e3) != op(e3,e0)
| op(e0,e4) != op(e4,e0)
| op(e0,e5) != op(e5,e0)
| op(e1,e0) != op(e0,e1)
| op(e1,e1) != op(e1,e1)
| op(e1,e2) != op(e2,e1)
| op(e1,e3) != op(e3,e1)
| op(e1,e4) != op(e4,e1)
| op(e1,e5) != op(e5,e1)
| op(e2,e0) != op(e0,e2)
| op(e2,e1) != op(e1,e2)
| op(e2,e2) != op(e2,e2)
| op(e2,e3) != op(e3,e2)
| op(e2,e4) != op(e4,e2)
| op(e2,e5) != op(e5,e2)
| op(e3,e0) != op(e0,e3)
| op(e3,e1) != op(e1,e3)
| op(e3,e2) != op(e2,e3)
| op(e3,e3) != op(e3,e3)
| op(e3,e4) != op(e4,e3)
| op(e3,e5) != op(e5,e3)
| op(e4,e0) != op(e0,e4)
| op(e4,e1) != op(e1,e4)
| op(e4,e2) != op(e2,e4)
| op(e4,e3) != op(e3,e4)
| op(e4,e4) != op(e4,e4)
| op(e4,e5) != op(e5,e4)
| op(e5,e0) != op(e0,e5)
| op(e5,e1) != op(e1,e5)
| op(e5,e2) != op(e2,e5)
| op(e5,e3) != op(e3,e5)
| op(e5,e4) != op(e4,e5)
| op(e5,e5) != op(e5,e5) )
& op(e0,e0) = op(e0,e0)
& op(e0,e1) = op(e1,e0)
& op(e0,e2) = op(e2,e0)
& op(e0,e3) = op(e3,e0)
& op(e0,e4) = op(e4,e0)
& op(e0,e5) = op(e5,e0)
& op(e1,e0) = op(e0,e1)
& op(e1,e1) = op(e1,e1)
& op(e1,e2) = op(e2,e1)
& op(e1,e3) = op(e3,e1)
& op(e1,e4) = op(e4,e1)
& op(e1,e5) = op(e5,e1)
& op(e2,e0) = op(e0,e2)
& op(e2,e1) = op(e1,e2)
& op(e2,e2) = op(e2,e2)
& op(e2,e3) = op(e3,e2)
& op(e2,e4) = op(e4,e2)
& op(e2,e5) = op(e5,e2)
& op(e3,e0) = op(e0,e3)
& op(e3,e1) = op(e1,e3)
& op(e3,e2) = op(e2,e3)
& op(e3,e3) = op(e3,e3)
& op(e3,e4) = op(e4,e3)
& op(e3,e5) = op(e5,e3)
& op(e4,e0) = op(e0,e4)
& op(e4,e1) = op(e1,e4)
& op(e4,e2) = op(e2,e4)
& op(e4,e3) = op(e3,e4)
& op(e4,e4) = op(e4,e4)
& op(e4,e5) = op(e5,e4)
& op(e5,e0) = op(e0,e5)
& op(e5,e1) = op(e1,e5)
& op(e5,e2) = op(e2,e5)
& op(e5,e3) = op(e3,e5)
& op(e5,e4) = op(e4,e5)
& op(e5,e5) = op(e5,e5) ),
inference(fof_nnf,[status(thm)],[c_0_1]) ).
cnf(c_0_3,negated_conjecture,
( $false
| op(e5,e4) != op(e4,e5)
| op(e5,e3) != op(e3,e5)
| op(e5,e2) != op(e2,e5)
| op(e5,e1) != op(e1,e5)
| op(e5,e0) != op(e0,e5)
| op(e4,e5) != op(e5,e4)
| $false
| op(e4,e3) != op(e3,e4)
| op(e4,e2) != op(e2,e4)
| op(e4,e1) != op(e1,e4)
| op(e4,e0) != op(e0,e4)
| op(e3,e5) != op(e5,e3)
| op(e3,e4) != op(e4,e3)
| $false
| op(e3,e2) != op(e2,e3)
| op(e3,e1) != op(e1,e3)
| op(e3,e0) != op(e0,e3)
| op(e2,e5) != op(e5,e2)
| op(e2,e4) != op(e4,e2)
| op(e2,e3) != op(e3,e2)
| $false
| op(e2,e1) != op(e1,e2)
| op(e2,e0) != op(e0,e2)
| op(e1,e5) != op(e5,e1)
| op(e1,e4) != op(e4,e1)
| op(e1,e3) != op(e3,e1)
| op(e1,e2) != op(e2,e1)
| $false
| op(e1,e0) != op(e0,e1)
| op(e0,e5) != op(e5,e0)
| op(e0,e4) != op(e4,e0)
| op(e0,e3) != op(e3,e0)
| op(e0,e2) != op(e2,e0)
| op(e0,e1) != op(e1,e0)
| $false ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( op(e1,e0) != op(e0,e1)
| op(e2,e0) != op(e0,e2)
| op(e2,e1) != op(e1,e2)
| op(e3,e0) != op(e0,e3)
| op(e3,e1) != op(e1,e3)
| op(e3,e2) != op(e2,e3)
| op(e4,e0) != op(e0,e4)
| op(e4,e1) != op(e1,e4)
| op(e4,e2) != op(e2,e4)
| op(e4,e3) != op(e3,e4)
| op(e5,e0) != op(e0,e5)
| op(e5,e1) != op(e1,e5)
| op(e5,e2) != op(e2,e5)
| op(e5,e3) != op(e3,e5)
| op(e5,e4) != op(e4,e5) ),
inference(cn,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
op(e1,e0) = op(e0,e1),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
op(e2,e0) = op(e0,e2),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
op(e2,e1) = op(e1,e2),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
op(e3,e0) = op(e0,e3),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
op(e3,e1) = op(e1,e3),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
op(e3,e2) = op(e2,e3),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
op(e4,e0) = op(e0,e4),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
op(e4,e1) = op(e1,e4),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
op(e4,e2) = op(e2,e4),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
op(e4,e3) = op(e3,e4),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
op(e5,e0) = op(e0,e5),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
op(e5,e1) = op(e1,e5),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_17,negated_conjecture,
op(e5,e2) = op(e2,e5),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_18,negated_conjecture,
op(e5,e3) = op(e3,e5),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_19,negated_conjecture,
op(e5,e4) = op(e4,e5),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_20,negated_conjecture,
$false,
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_6]),c_0_7]),c_0_8]),c_0_9]),c_0_10]),c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ALG025+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 00:20:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.035 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 21
% 0.23/1.41 # Proof object clause steps : 18
% 0.23/1.41 # Proof object formula steps : 3
% 0.23/1.41 # Proof object conjectures : 21
% 0.23/1.41 # Proof object clause conjectures : 18
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 16
% 0.23/1.41 # Proof object initial formulas used : 1
% 0.23/1.41 # Proof object generating inferences : 0
% 0.23/1.41 # Proof object simplifying inferences : 17
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 12
% 0.23/1.41 # Removed by relevancy pruning/SinE : 7
% 0.23/1.41 # Initial clauses : 484
% 0.23/1.41 # Removed in clause preprocessing : 6
% 0.23/1.41 # Initial clauses in saturation : 478
% 0.23/1.41 # Processed clauses : 393
% 0.23/1.41 # ...of these trivial : 25
% 0.23/1.41 # ...subsumed : 85
% 0.23/1.41 # ...remaining for further processing : 282
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 0
% 0.23/1.41 # ...of the previous two non-trivial : 0
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 0
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 282
% 0.23/1.41 # Positive orientable unit clauses : 180
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 102
% 0.23/1.41 # Non-unit-clauses : 0
% 0.23/1.41 # Current number of unprocessed clauses: 85
% 0.23/1.41 # ...number of literals in the above : 265
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 0
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 0
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 0
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 24487
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.041 s
% 0.23/1.41 # System time : 0.001 s
% 0.23/1.41 # Total time : 0.042 s
% 0.23/1.41 # Maximum resident set size: 4276 pages
%------------------------------------------------------------------------------