%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : ALG039+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:47:25 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 358 ( 277 equ)
% Maximal formula atoms : 271 ( 22 avg)
% Number of connectives : 433 ( 91 ~; 228 |; 113 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 72 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
~ ( ( ( op(e0,e0) = e0
& op(e1,e1) = e0
& op(e2,e2) = e0
& op(e3,e3) = e0 )
| ( op(e0,e0) = e1
& op(e1,e1) = e1
& op(e2,e2) = e1
& op(e3,e3) = e1 )
| ( op(e0,e0) = e2
& op(e1,e1) = e2
& op(e2,e2) = e2
& op(e3,e3) = e2 )
| ( op(e0,e0) = e3
& op(e1,e1) = e3
& op(e2,e2) = e3
& op(e3,e3) = e3 ) )
& ~ ( ( op(e0,e0) = e0
& op(e1,e1) = e0
& op(e2,e2) = e0
& op(e3,e3) = e0 )
| ( op(e0,e0) = e1
& op(e1,e1) = e1
& op(e2,e2) = e1
& op(e3,e3) = e1 )
| ( op(e0,e0) = e2
& op(e1,e1) = e2
& op(e2,e2) = e2
& op(e3,e3) = e2 )
| ( op(e0,e0) = e3
& op(e1,e1) = e3
& op(e2,e2) = e3
& op(e3,e3) = e3 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax6,axiom,
( e0 = op(e1,e1)
& e2 = op(e3,e1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax6) ).
fof(c_0_2,plain,
( epred1_0
<=> ( ( op(e0,e0) = e0
& op(e1,e1) = e0
& op(e2,e2) = e0
& op(e3,e3) = e0 )
| ( op(e0,e0) = e1
& op(e1,e1) = e1
& op(e2,e2) = e1
& op(e3,e3) = e1 )
| ( op(e0,e0) = e2
& op(e1,e1) = e2
& op(e2,e2) = e2
& op(e3,e3) = e2 ) ) ),
introduced(definition) ).
fof(c_0_3,negated_conjecture,
~ ~ ( ( epred1_0
| ( op(e0,e0) = e3
& op(e1,e1) = e3
& op(e2,e2) = e3
& op(e3,e3) = e3 ) )
& ~ ( epred1_0
| ( op(e0,e0) = e3
& op(e1,e1) = e3
& op(e2,e2) = e3
& op(e3,e3) = e3 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[co1]),c_0_2]),c_0_2]) ).
fof(c_0_4,negated_conjecture,
( ( op(e0,e0) = e3
| epred1_0 )
& ( op(e1,e1) = e3
| epred1_0 )
& ( op(e2,e2) = e3
| epred1_0 )
& ( op(e3,e3) = e3
| epred1_0 )
& ~ epred1_0
& ( op(e0,e0) != e3
| op(e1,e1) != e3
| op(e2,e2) != e3
| op(e3,e3) != e3 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
fof(c_0_5,plain,
( ( op(e0,e0) = e2
| op(e0,e0) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e0,e0) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e0,e0) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e0,e0) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e0,e0) = e2
| op(e1,e1) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e1,e1) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e1,e1) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e1,e1) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e0,e0) = e2
| op(e2,e2) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e2,e2) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e2,e2) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e2,e2) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e0,e0) = e2
| op(e3,e3) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e3,e3) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e3,e3) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e3,e3) = e1
| op(e0,e0) = e0
| ~ epred1_0 )
& ( op(e0,e0) = e2
| op(e0,e0) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e0,e0) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e0,e0) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e0,e0) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e0,e0) = e2
| op(e1,e1) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e1,e1) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e1,e1) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e1,e1) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e0,e0) = e2
| op(e2,e2) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e2,e2) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e2,e2) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e2,e2) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e0,e0) = e2
| op(e3,e3) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e3,e3) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e3,e3) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e3,e3) = e1
| op(e1,e1) = e0
| ~ epred1_0 )
& ( op(e0,e0) = e2
| op(e0,e0) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e0,e0) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e0,e0) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e0,e0) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e0,e0) = e2
| op(e1,e1) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e1,e1) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e1,e1) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e1,e1) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e0,e0) = e2
| op(e2,e2) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e2,e2) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e2,e2) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e2,e2) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e0,e0) = e2
| op(e3,e3) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e3,e3) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e3,e3) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e3,e3) = e1
| op(e2,e2) = e0
| ~ epred1_0 )
& ( op(e0,e0) = e2
| op(e0,e0) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e0,e0) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e0,e0) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e0,e0) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e0,e0) = e2
| op(e1,e1) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e1,e1) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e1,e1) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e1,e1) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e0,e0) = e2
| op(e2,e2) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e2,e2) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e2,e2) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e2,e2) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e0,e0) = e2
| op(e3,e3) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e1,e1) = e2
| op(e3,e3) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e2,e2) = e2
| op(e3,e3) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e3,e3) = e2
| op(e3,e3) = e1
| op(e3,e3) = e0
| ~ epred1_0 )
& ( op(e0,e0) != e0
| op(e1,e1) != e0
| op(e2,e2) != e0
| op(e3,e3) != e0
| epred1_0 )
& ( op(e0,e0) != e1
| op(e1,e1) != e1
| op(e2,e2) != e1
| op(e3,e3) != e1
| epred1_0 )
& ( op(e0,e0) != e2
| op(e1,e1) != e2
| op(e2,e2) != e2
| op(e3,e3) != e2
| epred1_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
cnf(c_0_6,negated_conjecture,
( epred1_0
| op(e1,e1) = e3 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
e0 = op(e1,e1),
inference(split_conjunct,[status(thm)],[ax6]) ).
cnf(c_0_8,negated_conjecture,
~ epred1_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( epred1_0
| op(e3,e3) = e3 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( epred1_0
| op(e2,e2) = e3 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
( epred1_0
| op(e3,e3) != e0
| op(e2,e2) != e0
| op(e1,e1) != e0
| op(e0,e0) != e0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
e0 = e3,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_13,negated_conjecture,
op(e3,e3) = e3,
inference(sr,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
op(e2,e2) = e3,
inference(sr,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_15,plain,
$false,
inference(sr,[status(thm)],[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)],[c_0_11,c_0_12]),c_0_12]),c_0_13]),c_0_12]),c_0_7]),c_0_12]),c_0_12]),c_0_14]),c_0_12]),c_0_13]),c_0_12])]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG039+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 8 21:22:31 EDT 2022
% 0.13/0.34 % 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.018 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 : 16
% 0.22/1.41 # Proof object clause steps : 10
% 0.22/1.41 # Proof object formula steps : 6
% 0.22/1.41 # Proof object conjectures : 10
% 0.22/1.41 # Proof object clause conjectures : 7
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 6
% 0.22/1.41 # Proof object initial formulas used : 2
% 0.22/1.41 # Proof object generating inferences : 0
% 0.22/1.41 # Proof object simplifying inferences : 17
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 7
% 0.22/1.41 # Removed by relevancy pruning/SinE : 1
% 0.22/1.41 # Initial clauses : 177
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 177
% 0.22/1.41 # Processed clauses : 12
% 0.22/1.41 # ...of these trivial : 1
% 0.22/1.41 # ...subsumed : 0
% 0.22/1.41 # ...remaining for further processing : 10
% 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 : 0
% 0.22/1.41 # Backward-rewritten : 2
% 0.22/1.41 # Generated clauses : 0
% 0.22/1.41 # ...of the previous two non-trivial : 2
% 0.22/1.41 # Contextual simplify-reflections : 0
% 0.22/1.41 # Paramodulations : 0
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 8
% 0.22/1.41 # Positive orientable unit clauses : 4
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 4
% 0.22/1.41 # Non-unit-clauses : 0
% 0.22/1.41 # Current number of unprocessed clauses: 167
% 0.22/1.41 # ...number of literals in the above : 511
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 2
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.22/1.41 # Non-unit clause-clause subsumptions : 0
% 0.22/1.41 # Unit Clause-clause subsumption calls : 0
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 1
% 0.22/1.41 # BW rewrite match successes : 1
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 8662
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.015 s
% 0.22/1.41 # System time : 0.004 s
% 0.22/1.41 # Total time : 0.019 s
% 0.22/1.41 # Maximum resident set size: 3132 pages
%------------------------------------------------------------------------------