%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO266+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:45:01 EDT 2022
% Result : Theorem 7.50s 2.25s
% Output : CNFRefutation 7.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 33 ( 7 unt; 12 nHn; 26 RR)
% Number of literals : 65 ( 0 equ; 32 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 36 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_68,negated_conjecture,
( ~ unequally_directed_opposite_lines(esk1_0,esk2_0)
| ~ unequally_directed_opposite_lines(esk2_0,esk1_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ix2222bg/input.p',i_0_68) ).
cnf(i_0_1,plain,
( unequally_directed_opposite_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ix2222bg/input.p',i_0_1) ).
cnf(i_0_2,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_opposite_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ix2222bg/input.p',i_0_2) ).
cnf(i_0_67,negated_conjecture,
( unequally_directed_opposite_lines(esk1_0,esk2_0)
| unequally_directed_opposite_lines(esk2_0,esk1_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ix2222bg/input.p',i_0_67) ).
cnf(i_0_65,plain,
( left_convergent_lines(X1,X2)
| left_convergent_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ix2222bg/input.p',i_0_65) ).
cnf(i_0_33,plain,
~ left_convergent_lines(X1,X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ix2222bg/input.p',i_0_33) ).
cnf(i_0_63,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ix2222bg/input.p',i_0_63) ).
cnf(i_0_55,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X3,X2)
| ~ unequally_directed_lines(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ix2222bg/input.p',i_0_55) ).
cnf(i_0_8,plain,
( ~ unequally_directed_lines(X1,X2)
| ~ equally_directed_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ix2222bg/input.p',i_0_8) ).
cnf(i_0_52,plain,
equally_directed_lines(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ix2222bg/input.p',i_0_52) ).
cnf(c_0_79,negated_conjecture,
( ~ unequally_directed_opposite_lines(esk1_0,esk2_0)
| ~ unequally_directed_opposite_lines(esk2_0,esk1_0) ),
i_0_68 ).
cnf(c_0_80,plain,
( unequally_directed_opposite_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
i_0_1 ).
cnf(c_0_81,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_opposite_lines(X1,X2) ),
i_0_2 ).
cnf(c_0_82,negated_conjecture,
( unequally_directed_opposite_lines(esk1_0,esk2_0)
| unequally_directed_opposite_lines(esk2_0,esk1_0) ),
i_0_67 ).
cnf(c_0_83,negated_conjecture,
( ~ unequally_directed_lines(esk2_0,reverse_line(esk1_0))
| ~ unequally_directed_opposite_lines(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_84,plain,
( left_convergent_lines(X1,X2)
| left_convergent_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
i_0_65 ).
cnf(c_0_85,plain,
~ left_convergent_lines(X1,X2),
i_0_33 ).
cnf(c_0_86,negated_conjecture,
( unequally_directed_lines(esk2_0,reverse_line(esk1_0))
| unequally_directed_opposite_lines(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_87,plain,
( ~ unequally_directed_lines(esk2_0,reverse_line(esk1_0))
| ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0)) ),
inference(spm,[status(thm)],[c_0_83,c_0_80]) ).
cnf(c_0_88,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X1,reverse_line(X2)) ),
i_0_63 ).
cnf(c_0_89,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_84,c_0_85]),c_0_85]) ).
cnf(c_0_90,plain,
( unequally_directed_lines(esk2_0,reverse_line(esk1_0))
| unequally_directed_lines(esk1_0,reverse_line(esk2_0)) ),
inference(spm,[status(thm)],[c_0_81,c_0_86]) ).
cnf(c_0_91,plain,
( unequally_directed_lines(esk2_0,esk1_0)
| ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0)) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_92,plain,
( unequally_directed_lines(esk1_0,reverse_line(esk2_0))
| ~ unequally_directed_lines(esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_93,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X3,X2)
| ~ unequally_directed_lines(X3,X1) ),
i_0_55 ).
cnf(c_0_94,plain,
( unequally_directed_lines(esk1_0,esk2_0)
| unequally_directed_lines(esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_91,c_0_88]) ).
cnf(c_0_95,plain,
( ~ unequally_directed_lines(X1,X2)
| ~ equally_directed_lines(X1,X2) ),
i_0_8 ).
cnf(c_0_96,plain,
equally_directed_lines(X1,X1),
i_0_52 ).
cnf(c_0_97,plain,
( ~ unequally_directed_lines(esk1_0,esk2_0)
| ~ unequally_directed_lines(esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_89,c_0_92]) ).
cnf(c_0_98,plain,
( unequally_directed_lines(esk2_0,X1)
| unequally_directed_lines(esk1_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_93]) ).
cnf(c_0_99,plain,
~ unequally_directed_lines(X1,X1),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_100,plain,
~ unequally_directed_lines(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_99]) ).
cnf(c_0_101,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_98]),c_0_100]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO266+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n014.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jun 18 05:27:21 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.50/2.25 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.50/2.25 # Version: 2.1pre011
% 7.50/2.25 # Preprocessing time : 0.012 s
% 7.50/2.25
% 7.50/2.25 # Proof found!
% 7.50/2.25 # SZS status Theorem
% 7.50/2.25 # SZS output start CNFRefutation
% See solution above
% 7.50/2.25 # Proof object total steps : 33
% 7.50/2.25 # Proof object clause steps : 23
% 7.50/2.25 # Proof object formula steps : 10
% 7.50/2.25 # Proof object conjectures : 6
% 7.50/2.25 # Proof object clause conjectures : 4
% 7.50/2.25 # Proof object formula conjectures : 2
% 7.50/2.25 # Proof object initial clauses used : 10
% 7.50/2.25 # Proof object initial formulas used : 10
% 7.50/2.25 # Proof object generating inferences : 12
% 7.50/2.25 # Proof object simplifying inferences : 5
% 7.50/2.25 # Training examples: 0 positive, 0 negative
% 7.50/2.25 # Parsed axioms : 68
% 7.50/2.25 # Removed by relevancy pruning/SinE : 0
% 7.50/2.25 # Initial clauses : 68
% 7.50/2.25 # Removed in clause preprocessing : 0
% 7.50/2.25 # Initial clauses in saturation : 68
% 7.50/2.25 # Processed clauses : 87
% 7.50/2.25 # ...of these trivial : 0
% 7.50/2.25 # ...subsumed : 22
% 7.50/2.25 # ...remaining for further processing : 64
% 7.50/2.25 # Other redundant clauses eliminated : 0
% 7.50/2.25 # Clauses deleted for lack of memory : 0
% 7.50/2.25 # Backward-subsumed : 3
% 7.50/2.25 # Backward-rewritten : 0
% 7.50/2.25 # Generated clauses : 66
% 7.50/2.25 # ...of the previous two non-trivial : 46
% 7.50/2.25 # Contextual simplify-reflections : 7
% 7.50/2.25 # Paramodulations : 51
% 7.50/2.25 # Factorizations : 14
% 7.50/2.25 # Equation resolutions : 0
% 7.50/2.25 # Propositional unsat checks : 0
% 7.50/2.25 # Propositional unsat check successes : 0
% 7.50/2.25 # Current number of processed clauses : 60
% 7.50/2.25 # Positive orientable unit clauses : 2
% 7.50/2.25 # Positive unorientable unit clauses: 0
% 7.50/2.25 # Negative unit clauses : 12
% 7.50/2.25 # Non-unit-clauses : 46
% 7.50/2.25 # Current number of unprocessed clauses: 25
% 7.50/2.25 # ...number of literals in the above : 50
% 7.50/2.25 # Current number of archived formulas : 0
% 7.50/2.25 # Current number of archived clauses : 4
% 7.50/2.25 # Clause-clause subsumption calls (NU) : 491
% 7.50/2.25 # Rec. Clause-clause subsumption calls : 321
% 7.50/2.25 # Non-unit clause-clause subsumptions : 14
% 7.50/2.25 # Unit Clause-clause subsumption calls : 122
% 7.50/2.25 # Rewrite failures with RHS unbound : 0
% 7.50/2.25 # BW rewrite match attempts : 0
% 7.50/2.25 # BW rewrite match successes : 0
% 7.50/2.25 # Condensation attempts : 0
% 7.50/2.25 # Condensation successes : 0
% 7.50/2.25 # Termbank termtop insertions : 1896
% 7.50/2.25
% 7.50/2.25 # -------------------------------------------------
% 7.50/2.25 # User time : 0.007 s
% 7.50/2.25 # System time : 0.007 s
% 7.50/2.25 # Total time : 0.014 s
% 7.50/2.25 # ...preprocessing : 0.012 s
% 7.50/2.25 # ...main loop : 0.002 s
% 7.50/2.25 # Maximum resident set size: 7132 pages
% 7.50/2.25
%------------------------------------------------------------------------------