TSTP Solution File: ALG194+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : ALG194+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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:49:41 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 212 ( 211 equ)
% Maximal formula atoms : 112 ( 9 avg)
% Number of connectives : 296 ( 106 ~; 114 |; 76 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 53 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
( ( op(e0,e0) != e0
& op(e1,e1) != e1
& op(e2,e2) != e2
& op(e3,e3) != e3
& op(e4,e4) != e4
& op(e5,e5) != e5
& op(e6,e6) != e6 )
| ( op(e0,e0) = e0
& op(e1,e1) = e1
& op(e2,e2) = e2
& op(e3,e3) = e3
& op(e4,e4) = e4
& op(e5,e5) = e5
& op(e6,e6) = e6 )
| ( ( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| op(e4,e4) = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 )
& ( op(e0,e0) != e0
| op(e1,e1) != e1
| op(e2,e2) != e2
| op(e3,e3) != e3
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(c_0_1,negated_conjecture,
~ ( ( op(e0,e0) != e0
& op(e1,e1) != e1
& op(e2,e2) != e2
& op(e3,e3) != e3
& op(e4,e4) != e4
& op(e5,e5) != e5
& op(e6,e6) != e6 )
| ( op(e0,e0) = e0
& op(e1,e1) = e1
& op(e2,e2) = e2
& op(e3,e3) = e3
& op(e4,e4) = e4
& op(e5,e5) = e5
& op(e6,e6) = e6 )
| ( ( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| op(e4,e4) = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 )
& ( op(e0,e0) != e0
| op(e1,e1) != e1
| op(e2,e2) != e2
| op(e3,e3) != e3
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_2,negated_conjecture,
( ( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| op(e4,e4) = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 )
& ( op(e0,e0) != e0
| op(e1,e1) != e1
| op(e2,e2) != e2
| op(e3,e3) != e3
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 )
& ( op(e0,e0) = e0
| op(e0,e0) != e0 )
& ( op(e1,e1) = e1
| op(e0,e0) != e0 )
& ( op(e2,e2) = e2
| op(e0,e0) != e0 )
& ( op(e3,e3) = e3
| op(e0,e0) != e0 )
& ( op(e4,e4) = e4
| op(e0,e0) != e0 )
& ( op(e5,e5) = e5
| op(e0,e0) != e0 )
& ( op(e6,e6) = e6
| op(e0,e0) != e0 )
& ( op(e0,e0) = e0
| op(e1,e1) != e1 )
& ( op(e1,e1) = e1
| op(e1,e1) != e1 )
& ( op(e2,e2) = e2
| op(e1,e1) != e1 )
& ( op(e3,e3) = e3
| op(e1,e1) != e1 )
& ( op(e4,e4) = e4
| op(e1,e1) != e1 )
& ( op(e5,e5) = e5
| op(e1,e1) != e1 )
& ( op(e6,e6) = e6
| op(e1,e1) != e1 )
& ( op(e0,e0) = e0
| op(e2,e2) != e2 )
& ( op(e1,e1) = e1
| op(e2,e2) != e2 )
& ( op(e2,e2) = e2
| op(e2,e2) != e2 )
& ( op(e3,e3) = e3
| op(e2,e2) != e2 )
& ( op(e4,e4) = e4
| op(e2,e2) != e2 )
& ( op(e5,e5) = e5
| op(e2,e2) != e2 )
& ( op(e6,e6) = e6
| op(e2,e2) != e2 )
& ( op(e0,e0) = e0
| op(e3,e3) != e3 )
& ( op(e1,e1) = e1
| op(e3,e3) != e3 )
& ( op(e2,e2) = e2
| op(e3,e3) != e3 )
& ( op(e3,e3) = e3
| op(e3,e3) != e3 )
& ( op(e4,e4) = e4
| op(e3,e3) != e3 )
& ( op(e5,e5) = e5
| op(e3,e3) != e3 )
& ( op(e6,e6) = e6
| op(e3,e3) != e3 )
& ( op(e0,e0) = e0
| op(e4,e4) != e4 )
& ( op(e1,e1) = e1
| op(e4,e4) != e4 )
& ( op(e2,e2) = e2
| op(e4,e4) != e4 )
& ( op(e3,e3) = e3
| op(e4,e4) != e4 )
& ( op(e4,e4) = e4
| op(e4,e4) != e4 )
& ( op(e5,e5) = e5
| op(e4,e4) != e4 )
& ( op(e6,e6) = e6
| op(e4,e4) != e4 )
& ( op(e0,e0) = e0
| op(e5,e5) != e5 )
& ( op(e1,e1) = e1
| op(e5,e5) != e5 )
& ( op(e2,e2) = e2
| op(e5,e5) != e5 )
& ( op(e3,e3) = e3
| op(e5,e5) != e5 )
& ( op(e4,e4) = e4
| op(e5,e5) != e5 )
& ( op(e5,e5) = e5
| op(e5,e5) != e5 )
& ( op(e6,e6) = e6
| op(e5,e5) != e5 )
& ( op(e0,e0) = e0
| op(e6,e6) != e6 )
& ( op(e1,e1) = e1
| op(e6,e6) != e6 )
& ( op(e2,e2) = e2
| op(e6,e6) != e6 )
& ( op(e3,e3) = e3
| op(e6,e6) != e6 )
& ( op(e4,e4) = e4
| op(e6,e6) != e6 )
& ( op(e5,e5) = e5
| op(e6,e6) != e6 )
& ( op(e6,e6) = e6
| op(e6,e6) != e6 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])]) ).
cnf(c_0_3,negated_conjecture,
( op(e6,e6) = e6
| op(e5,e5) = e5
| op(e4,e4) = e4
| op(e3,e3) = e3
| op(e2,e2) = e2
| op(e1,e1) = e1
| op(e0,e0) = e0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( op(e0,e0) = e0
| op(e6,e6) != e6 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( op(e0,e0) = e0
| op(e5,e5) != e5 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( op(e0,e0) = e0
| op(e4,e4) != e4 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( op(e0,e0) = e0
| op(e3,e3) != e3 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( op(e0,e0) = e0
| op(e2,e2) != e2 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( op(e0,e0) = e0
| op(e1,e1) != e1 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( op(e6,e6) = e6
| op(e0,e0) != e0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
op(e0,e0) = e0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_3,c_0_4]),c_0_5]),c_0_6]),c_0_7]),c_0_8]),c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( op(e6,e6) != e6
| op(e5,e5) != e5
| op(e4,e4) != e4
| op(e3,e3) != e3
| op(e2,e2) != e2
| op(e1,e1) != e1
| op(e0,e0) != e0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( op(e6,e6) = e6
| op(e1,e1) != e1 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( op(e5,e5) = e5
| op(e1,e1) != e1 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
( op(e4,e4) = e4
| op(e1,e1) != e1 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
( op(e3,e3) = e3
| op(e1,e1) != e1 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_17,negated_conjecture,
( op(e2,e2) = e2
| op(e1,e1) != e1 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_18,negated_conjecture,
( op(e1,e1) = e1
| op(e6,e6) != e6 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_19,negated_conjecture,
op(e6,e6) = e6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_20,negated_conjecture,
op(e1,e1) != e1,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11])]),c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ALG194+1 : TPTP v8.1.0. Released v2.7.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Wed Jun 8 03:39:31 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.061 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 22
% 0.22/1.41 # Proof object clause steps : 19
% 0.22/1.41 # Proof object formula steps : 3
% 0.22/1.41 # Proof object conjectures : 22
% 0.22/1.41 # Proof object clause conjectures : 19
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 15
% 0.22/1.41 # Proof object initial formulas used : 1
% 0.22/1.41 # Proof object generating inferences : 0
% 0.22/1.41 # Proof object simplifying inferences : 18
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 6
% 0.22/1.41 # Removed by relevancy pruning/SinE : 0
% 0.22/1.41 # Initial clauses : 562
% 0.22/1.41 # Removed in clause preprocessing : 7
% 0.22/1.41 # Initial clauses in saturation : 555
% 0.22/1.41 # Processed clauses : 557
% 0.22/1.41 # ...of these trivial : 3
% 0.22/1.41 # ...subsumed : 0
% 0.22/1.41 # ...remaining for further processing : 554
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 7
% 0.22/1.41 # Backward-rewritten : 36
% 0.22/1.41 # Generated clauses : 2398
% 0.22/1.41 # ...of the previous two non-trivial : 1837
% 0.22/1.41 # Contextual simplify-reflections : 11
% 0.22/1.41 # Paramodulations : 2109
% 0.22/1.41 # Factorizations : 286
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 508
% 0.22/1.41 # Positive orientable unit clauses : 49
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 301
% 0.22/1.41 # Non-unit-clauses : 158
% 0.22/1.41 # Current number of unprocessed clauses: 1407
% 0.22/1.41 # ...number of literals in the above : 10679
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 46
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 2054
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 46
% 0.22/1.41 # Non-unit clause-clause subsumptions : 11
% 0.22/1.41 # Unit Clause-clause subsumption calls : 2496
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 143
% 0.22/1.41 # BW rewrite match successes : 2
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 55903
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.264 s
% 0.22/1.41 # System time : 0.003 s
% 0.22/1.41 # Total time : 0.267 s
% 0.22/1.41 # Maximum resident set size: 6040 pages
%------------------------------------------------------------------------------