TSTP Solution File: ALG199+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : ALG199+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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:50:16 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 9 unt; 0 def)
% Number of atoms : 106 ( 105 equ)
% Maximal formula atoms : 21 ( 7 avg)
% Number of connectives : 164 ( 73 ~; 42 |; 49 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Maximal term depth : 6 ( 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 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax6,axiom,
( e0 = op(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),op(e5,op(e5,e5)))
& e1 = op(e5,e5)
& e2 = op(op(e5,op(e5,e5)),op(e5,op(e5,e5)))
& e3 = op(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),e5)
& e4 = op(e5,op(e5,e5))
& e6 = op(op(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),e5),op(e5,op(e5,e5))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax6) ).
fof(ax5,axiom,
( e0 != e1
& e0 != e2
& e0 != e3
& e0 != e4
& e0 != e5
& e0 != e6
& e1 != e2
& e1 != e3
& e1 != e4
& e1 != e5
& e1 != e6
& e2 != e3
& e2 != e4
& e2 != e5
& e2 != e6
& e3 != e4
& e3 != e5
& e3 != e6
& e4 != e5
& e4 != e6
& e5 != e6 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax5) ).
fof(c_0_3,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 ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_4,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 ) ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
cnf(c_0_5,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_4]) ).
cnf(c_0_6,plain,
e1 = op(e5,e5),
inference(split_conjunct,[status(thm)],[ax6]) ).
cnf(c_0_7,negated_conjecture,
op(e0,e0) != e0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
op(e1,e1) != e1,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
op(e2,e2) != e2,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
op(e3,e3) != e3,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
op(e4,e4) != e4,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
e1 != e5,
inference(split_conjunct,[status(thm)],[ax5]) ).
cnf(c_0_13,negated_conjecture,
op(e6,e6) != e6,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[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]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ALG199+1 : TPTP v8.1.0. Released v2.7.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n017.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 : Wed Jun 8 00:07:33 EDT 2022
% 0.12/0.33 % 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.019 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 : 15
% 0.24/1.42 # Proof object clause steps : 10
% 0.24/1.42 # Proof object formula steps : 5
% 0.24/1.42 # Proof object conjectures : 11
% 0.24/1.42 # Proof object clause conjectures : 8
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 9
% 0.24/1.42 # Proof object initial formulas used : 3
% 0.24/1.42 # Proof object generating inferences : 0
% 0.24/1.42 # Proof object simplifying inferences : 8
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 7
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 526
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 526
% 0.24/1.42 # Processed clauses : 64
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 1
% 0.24/1.42 # ...remaining for further processing : 62
% 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 : 7
% 0.24/1.42 # ...of the previous two non-trivial : 7
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 2
% 0.24/1.42 # Factorizations : 5
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 62
% 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 : 30
% 0.24/1.42 # Non-unit-clauses : 1
% 0.24/1.42 # Current number of unprocessed clauses: 469
% 0.24/1.42 # ...number of literals in the above : 1386
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 0
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.24/1.42 # Non-unit clause-clause subsumptions : 0
% 0.24/1.42 # Unit Clause-clause subsumption calls : 35
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 84
% 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 : 33061
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.017 s
% 0.24/1.42 # System time : 0.003 s
% 0.24/1.42 # Total time : 0.020 s
% 0.24/1.42 # Maximum resident set size: 3864 pages
%------------------------------------------------------------------------------