%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO547+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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 : Sat Jul 16 03:46:12 EDT 2022
% Result : Theorem 7.73s 2.41s
% Output : CNFRefutation 7.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of clauses : 35 ( 22 unt; 0 nHn; 35 RR)
% Number of literals : 50 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_20,plain,
( coll(X1,X2,X3)
| ~ coll(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-slp84orc/input.p',i_0_20) ).
cnf(i_0_2,negated_conjecture,
coll(esk8_0,esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-slp84orc/input.p',i_0_2) ).
cnf(i_0_42,plain,
( coll(X1,X2,X3)
| ~ coll(X3,X4,X2)
| ~ coll(X3,X4,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-slp84orc/input.p',i_0_42) ).
cnf(i_0_4,negated_conjecture,
coll(esk7_0,esk1_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-slp84orc/input.p',i_0_4) ).
cnf(i_0_6,negated_conjecture,
coll(esk6_0,esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-slp84orc/input.p',i_0_6) ).
cnf(i_0_1,negated_conjecture,
~ coll(esk6_0,esk7_0,esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-slp84orc/input.p',i_0_1) ).
cnf(c_0_49,plain,
( coll(X1,X2,X3)
| ~ coll(X1,X3,X2) ),
i_0_20 ).
cnf(c_0_50,negated_conjecture,
coll(esk8_0,esk1_0,esk2_0),
i_0_2 ).
cnf(c_0_51,plain,
( coll(X1,X2,X3)
| ~ coll(X3,X4,X2)
| ~ coll(X3,X4,X1) ),
i_0_42 ).
cnf(c_0_52,negated_conjecture,
coll(esk8_0,esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
coll(esk7_0,esk1_0,esk3_0),
i_0_4 ).
cnf(c_0_54,plain,
( coll(X1,esk1_0,esk8_0)
| ~ coll(esk8_0,esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
coll(esk7_0,esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_49,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
coll(esk6_0,esk2_0,esk3_0),
i_0_6 ).
cnf(c_0_57,negated_conjecture,
coll(esk1_0,esk1_0,esk8_0),
inference(spm,[status(thm)],[c_0_54,c_0_52]) ).
cnf(c_0_58,plain,
( coll(X1,esk1_0,esk7_0)
| ~ coll(esk7_0,esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
( coll(X1,esk2_0,esk8_0)
| ~ coll(esk8_0,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_50]) ).
cnf(c_0_60,negated_conjecture,
coll(esk6_0,esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_49,c_0_56]) ).
cnf(c_0_61,plain,
( coll(X1,esk8_0,esk1_0)
| ~ coll(esk1_0,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
coll(esk1_0,esk1_0,esk7_0),
inference(spm,[status(thm)],[c_0_58,c_0_55]) ).
cnf(c_0_63,negated_conjecture,
coll(esk2_0,esk2_0,esk8_0),
inference(spm,[status(thm)],[c_0_59,c_0_50]) ).
cnf(c_0_64,plain,
( coll(X1,esk2_0,esk6_0)
| ~ coll(esk6_0,esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_60]) ).
cnf(c_0_65,negated_conjecture,
coll(esk7_0,esk8_0,esk1_0),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_66,plain,
( coll(X1,esk8_0,esk2_0)
| ~ coll(esk2_0,esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
coll(esk2_0,esk2_0,esk6_0),
inference(spm,[status(thm)],[c_0_64,c_0_60]) ).
cnf(c_0_68,negated_conjecture,
( coll(X1,esk3_0,esk7_0)
| ~ coll(esk7_0,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_53]) ).
cnf(c_0_69,plain,
coll(esk7_0,esk1_0,esk8_0),
inference(spm,[status(thm)],[c_0_49,c_0_65]) ).
cnf(c_0_70,plain,
coll(esk6_0,esk8_0,esk2_0),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,negated_conjecture,
coll(esk8_0,esk3_0,esk7_0),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_72,negated_conjecture,
( coll(X1,esk3_0,esk6_0)
| ~ coll(esk6_0,esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_56]) ).
cnf(c_0_73,plain,
coll(esk6_0,esk2_0,esk8_0),
inference(spm,[status(thm)],[c_0_49,c_0_70]) ).
cnf(c_0_74,plain,
( coll(X1,esk7_0,esk8_0)
| ~ coll(esk8_0,esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_71]) ).
cnf(c_0_75,negated_conjecture,
coll(esk8_0,esk3_0,esk6_0),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,negated_conjecture,
~ coll(esk6_0,esk7_0,esk8_0),
i_0_1 ).
cnf(c_0_77,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : GEO547+1 : TPTP v8.1.0. Released v7.5.0.
% 0.01/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n005.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 : Sat Jun 18 04:12:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.73/2.41 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.73/2.41 # Version: 2.1pre011
% 7.73/2.41 # Preprocessing time : 0.012 s
% 7.73/2.41
% 7.73/2.41 # Proof found!
% 7.73/2.41 # SZS status Theorem
% 7.73/2.41 # SZS output start CNFRefutation
% See solution above
% 7.73/2.41 # Proof object total steps : 35
% 7.73/2.41 # Proof object clause steps : 29
% 7.73/2.41 # Proof object formula steps : 6
% 7.73/2.41 # Proof object conjectures : 22
% 7.73/2.41 # Proof object clause conjectures : 18
% 7.73/2.41 # Proof object formula conjectures : 4
% 7.73/2.41 # Proof object initial clauses used : 6
% 7.73/2.41 # Proof object initial formulas used : 6
% 7.73/2.41 # Proof object generating inferences : 23
% 7.73/2.41 # Proof object simplifying inferences : 1
% 7.73/2.41 # Training examples: 0 positive, 0 negative
% 7.73/2.41 # Parsed axioms : 122
% 7.73/2.41 # Removed by relevancy pruning/SinE : 0
% 7.73/2.41 # Initial clauses : 122
% 7.73/2.41 # Removed in clause preprocessing : 0
% 7.73/2.41 # Initial clauses in saturation : 122
% 7.73/2.41 # Processed clauses : 409
% 7.73/2.41 # ...of these trivial : 24
% 7.73/2.41 # ...subsumed : 17
% 7.73/2.41 # ...remaining for further processing : 368
% 7.73/2.41 # Other redundant clauses eliminated : 0
% 7.73/2.41 # Clauses deleted for lack of memory : 0
% 7.73/2.41 # Backward-subsumed : 0
% 7.73/2.41 # Backward-rewritten : 0
% 7.73/2.41 # Generated clauses : 1466
% 7.73/2.41 # ...of the previous two non-trivial : 1191
% 7.73/2.41 # Contextual simplify-reflections : 6
% 7.73/2.41 # Paramodulations : 1466
% 7.73/2.41 # Factorizations : 0
% 7.73/2.41 # Equation resolutions : 0
% 7.73/2.41 # Propositional unsat checks : 0
% 7.73/2.41 # Propositional unsat check successes : 0
% 7.73/2.41 # Current number of processed clauses : 368
% 7.73/2.41 # Positive orientable unit clauses : 134
% 7.73/2.41 # Positive unorientable unit clauses: 0
% 7.73/2.41 # Negative unit clauses : 1
% 7.73/2.41 # Non-unit-clauses : 233
% 7.73/2.41 # Current number of unprocessed clauses: 900
% 7.73/2.41 # ...number of literals in the above : 2977
% 7.73/2.41 # Current number of archived formulas : 0
% 7.73/2.41 # Current number of archived clauses : 0
% 7.73/2.41 # Clause-clause subsumption calls (NU) : 4205
% 7.73/2.41 # Rec. Clause-clause subsumption calls : 3077
% 7.73/2.41 # Non-unit clause-clause subsumptions : 23
% 7.73/2.41 # Unit Clause-clause subsumption calls : 2405
% 7.73/2.41 # Rewrite failures with RHS unbound : 0
% 7.73/2.41 # BW rewrite match attempts : 253
% 7.73/2.41 # BW rewrite match successes : 0
% 7.73/2.41 # Condensation attempts : 0
% 7.73/2.41 # Condensation successes : 0
% 7.73/2.41 # Termbank termtop insertions : 19280
% 7.73/2.41
% 7.73/2.41 # -------------------------------------------------
% 7.73/2.41 # User time : 0.027 s
% 7.73/2.41 # System time : 0.006 s
% 7.73/2.41 # Total time : 0.033 s
% 7.73/2.41 # ...preprocessing : 0.012 s
% 7.73/2.41 # ...main loop : 0.021 s
% 7.73/2.41 # Maximum resident set size: 7132 pages
% 7.73/2.41
%------------------------------------------------------------------------------