%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO178+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : Sat Jul 16 03:43:58 EDT 2022
% Result : Theorem 8.36s 2.50s
% Output : CNFRefutation 8.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 7 unt; 3 nHn; 13 RR)
% Number of literals : 27 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
( distinct_points(X1,X2)
| apart_point_and_line(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vh9iaaso/input.p',i_0_7) ).
cnf(i_0_15,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vh9iaaso/input.p',i_0_15) ).
cnf(i_0_10,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vh9iaaso/input.p',i_0_10) ).
cnf(i_0_16,negated_conjecture,
distinct_points(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vh9iaaso/input.p',i_0_16) ).
cnf(i_0_14,negated_conjecture,
( ~ distinct_points(esk3_0,esk1_0)
| ~ distinct_points(esk3_0,esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vh9iaaso/input.p',i_0_14) ).
cnf(i_0_11,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vh9iaaso/input.p',i_0_11) ).
cnf(c_0_23,plain,
( distinct_points(X1,X2)
| apart_point_and_line(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
i_0_7 ).
cnf(c_0_24,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
i_0_15 ).
cnf(c_0_25,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
i_0_10 ).
cnf(c_0_26,negated_conjecture,
( apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))
| distinct_points(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
distinct_points(esk1_0,esk2_0),
i_0_16 ).
cnf(c_0_28,negated_conjecture,
( ~ distinct_points(esk3_0,esk1_0)
| ~ distinct_points(esk3_0,esk2_0) ),
i_0_14 ).
cnf(c_0_29,plain,
distinct_points(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_30,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
i_0_11 ).
cnf(c_0_31,negated_conjecture,
~ distinct_points(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_26]),c_0_27])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GEO178+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 17 22:02:00 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 # 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
% 8.36/2.50 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.36/2.50 # Version: 2.1pre011
% 8.36/2.50 # Preprocessing time : 0.018 s
% 8.36/2.50
% 8.36/2.50 # Proof found!
% 8.36/2.50 # SZS status Theorem
% 8.36/2.50 # SZS output start CNFRefutation
% See solution above
% 8.36/2.50 # Proof object total steps : 16
% 8.36/2.50 # Proof object clause steps : 10
% 8.36/2.50 # Proof object formula steps : 6
% 8.36/2.50 # Proof object conjectures : 8
% 8.36/2.50 # Proof object clause conjectures : 5
% 8.36/2.50 # Proof object formula conjectures : 3
% 8.36/2.50 # Proof object initial clauses used : 6
% 8.36/2.50 # Proof object initial formulas used : 6
% 8.36/2.50 # Proof object generating inferences : 3
% 8.36/2.50 # Proof object simplifying inferences : 7
% 8.36/2.50 # Training examples: 0 positive, 0 negative
% 8.36/2.50 # Parsed axioms : 17
% 8.36/2.50 # Removed by relevancy pruning/SinE : 0
% 8.36/2.50 # Initial clauses : 17
% 8.36/2.50 # Removed in clause preprocessing : 0
% 8.36/2.50 # Initial clauses in saturation : 17
% 8.36/2.50 # Processed clauses : 27
% 8.36/2.50 # ...of these trivial : 0
% 8.36/2.50 # ...subsumed : 1
% 8.36/2.50 # ...remaining for further processing : 25
% 8.36/2.50 # Other redundant clauses eliminated : 0
% 8.36/2.50 # Clauses deleted for lack of memory : 0
% 8.36/2.50 # Backward-subsumed : 0
% 8.36/2.50 # Backward-rewritten : 1
% 8.36/2.50 # Generated clauses : 32
% 8.36/2.50 # ...of the previous two non-trivial : 30
% 8.36/2.50 # Contextual simplify-reflections : 0
% 8.36/2.50 # Paramodulations : 30
% 8.36/2.50 # Factorizations : 2
% 8.36/2.50 # Equation resolutions : 0
% 8.36/2.50 # Propositional unsat checks : 0
% 8.36/2.50 # Propositional unsat check successes : 0
% 8.36/2.50 # Current number of processed clauses : 24
% 8.36/2.50 # Positive orientable unit clauses : 4
% 8.36/2.50 # Positive unorientable unit clauses: 0
% 8.36/2.50 # Negative unit clauses : 4
% 8.36/2.50 # Non-unit-clauses : 16
% 8.36/2.50 # Current number of unprocessed clauses: 20
% 8.36/2.50 # ...number of literals in the above : 62
% 8.36/2.50 # Current number of archived formulas : 0
% 8.36/2.50 # Current number of archived clauses : 1
% 8.36/2.50 # Clause-clause subsumption calls (NU) : 13
% 8.36/2.50 # Rec. Clause-clause subsumption calls : 12
% 8.36/2.50 # Non-unit clause-clause subsumptions : 1
% 8.36/2.50 # Unit Clause-clause subsumption calls : 3
% 8.36/2.50 # Rewrite failures with RHS unbound : 0
% 8.36/2.50 # BW rewrite match attempts : 1
% 8.36/2.50 # BW rewrite match successes : 1
% 8.36/2.50 # Condensation attempts : 0
% 8.36/2.50 # Condensation successes : 0
% 8.36/2.50 # Termbank termtop insertions : 655
% 8.36/2.50
% 8.36/2.50 # -------------------------------------------------
% 8.36/2.50 # User time : 0.016 s
% 8.36/2.50 # System time : 0.003 s
% 8.36/2.50 # Total time : 0.019 s
% 8.36/2.50 # ...preprocessing : 0.018 s
% 8.36/2.50 # ...main loop : 0.001 s
% 8.36/2.50 # Maximum resident set size: 7128 pages
% 8.36/2.50
%------------------------------------------------------------------------------