TSTP Solution File: GEO200+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO200+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:44:19 EDT 2022
% Result : Theorem 7.67s 2.41s
% Output : CNFRefutation 7.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 9 unt; 9 nHn; 19 RR)
% Number of literals : 55 ( 0 equ; 17 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( distinct_points(X1,X2)
| distinct_points(X3,X2)
| ~ distinct_points(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f8gf13m7/input.p',i_0_4) ).
cnf(i_0_15,negated_conjecture,
distinct_points(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f8gf13m7/input.p',i_0_15) ).
cnf(i_0_16,plain,
( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X4,X2)
| apart_point_and_line(X4,X3)
| ~ distinct_points(X4,X1)
| ~ distinct_lines(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f8gf13m7/input.p',i_0_16) ).
cnf(i_0_14,negated_conjecture,
distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f8gf13m7/input.p',i_0_14) ).
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f8gf13m7/input.p',i_0_1) ).
cnf(i_0_11,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X2,X3)
| ~ apart_point_and_line(X1,line_connecting(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f8gf13m7/input.p',i_0_11) ).
cnf(i_0_10,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X3,X2)
| ~ apart_point_and_line(X1,line_connecting(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f8gf13m7/input.p',i_0_10) ).
cnf(c_0_24,plain,
( distinct_points(X1,X2)
| distinct_points(X3,X2)
| ~ distinct_points(X3,X1) ),
i_0_4 ).
cnf(c_0_25,negated_conjecture,
distinct_points(esk1_0,esk2_0),
i_0_15 ).
cnf(c_0_26,plain,
( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X4,X2)
| apart_point_and_line(X4,X3)
| ~ distinct_points(X4,X1)
| ~ distinct_lines(X3,X2) ),
i_0_16 ).
cnf(c_0_27,negated_conjecture,
distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0)),
i_0_14 ).
cnf(c_0_28,plain,
~ distinct_points(X1,X1),
i_0_1 ).
cnf(c_0_29,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X1,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X2,line_connecting(esk2_0,esk1_0))
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
distinct_points(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X2,X3)
| ~ apart_point_and_line(X1,line_connecting(X2,X3)) ),
i_0_11 ).
cnf(c_0_33,plain,
( apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X3,X2)
| ~ apart_point_and_line(X1,line_connecting(X3,X2)) ),
i_0_10 ).
cnf(c_0_35,plain,
( apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_25])]),c_0_28]) ).
cnf(c_0_36,plain,
( apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_31])]),c_0_28]) ).
cnf(c_0_37,plain,
apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_36]),c_0_25])]),c_0_28]) ).
cnf(c_0_38,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_37]),c_0_31])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GEO200+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n008.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 : Sat Jun 18 08:53:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.67/2.41 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.67/2.41 # Version: 2.1pre011
% 7.67/2.41 # Preprocessing time : 0.010 s
% 7.67/2.41
% 7.67/2.41 # Proof found!
% 7.67/2.41 # SZS status Theorem
% 7.67/2.41 # SZS output start CNFRefutation
% See solution above
% 7.67/2.41 # Proof object total steps : 22
% 7.67/2.41 # Proof object clause steps : 15
% 7.67/2.41 # Proof object formula steps : 7
% 7.67/2.41 # Proof object conjectures : 6
% 7.67/2.41 # Proof object clause conjectures : 4
% 7.67/2.41 # Proof object formula conjectures : 2
% 7.67/2.41 # Proof object initial clauses used : 7
% 7.67/2.41 # Proof object initial formulas used : 7
% 7.67/2.41 # Proof object generating inferences : 8
% 7.67/2.41 # Proof object simplifying inferences : 12
% 7.67/2.41 # Training examples: 0 positive, 0 negative
% 7.67/2.41 # Parsed axioms : 16
% 7.67/2.41 # Removed by relevancy pruning/SinE : 0
% 7.67/2.41 # Initial clauses : 16
% 7.67/2.41 # Removed in clause preprocessing : 0
% 7.67/2.41 # Initial clauses in saturation : 16
% 7.67/2.41 # Processed clauses : 42
% 7.67/2.41 # ...of these trivial : 0
% 7.67/2.41 # ...subsumed : 6
% 7.67/2.41 # ...remaining for further processing : 36
% 7.67/2.41 # Other redundant clauses eliminated : 0
% 7.67/2.41 # Clauses deleted for lack of memory : 0
% 7.67/2.41 # Backward-subsumed : 2
% 7.67/2.41 # Backward-rewritten : 1
% 7.67/2.41 # Generated clauses : 131
% 7.67/2.41 # ...of the previous two non-trivial : 118
% 7.67/2.41 # Contextual simplify-reflections : 0
% 7.67/2.41 # Paramodulations : 111
% 7.67/2.41 # Factorizations : 20
% 7.67/2.41 # Equation resolutions : 0
% 7.67/2.41 # Propositional unsat checks : 0
% 7.67/2.41 # Propositional unsat check successes : 0
% 7.67/2.41 # Current number of processed clauses : 33
% 7.67/2.41 # Positive orientable unit clauses : 5
% 7.67/2.41 # Positive unorientable unit clauses: 0
% 7.67/2.41 # Negative unit clauses : 3
% 7.67/2.41 # Non-unit-clauses : 25
% 7.67/2.41 # Current number of unprocessed clauses: 76
% 7.67/2.41 # ...number of literals in the above : 387
% 7.67/2.41 # Current number of archived formulas : 0
% 7.67/2.41 # Current number of archived clauses : 3
% 7.67/2.41 # Clause-clause subsumption calls (NU) : 102
% 7.67/2.41 # Rec. Clause-clause subsumption calls : 69
% 7.67/2.41 # Non-unit clause-clause subsumptions : 8
% 7.67/2.41 # Unit Clause-clause subsumption calls : 5
% 7.67/2.41 # Rewrite failures with RHS unbound : 0
% 7.67/2.41 # BW rewrite match attempts : 1
% 7.67/2.41 # BW rewrite match successes : 1
% 7.67/2.41 # Condensation attempts : 0
% 7.67/2.41 # Condensation successes : 0
% 7.67/2.41 # Termbank termtop insertions : 2315
% 7.67/2.41
% 7.67/2.41 # -------------------------------------------------
% 7.67/2.41 # User time : 0.010 s
% 7.67/2.41 # System time : 0.002 s
% 7.67/2.41 # Total time : 0.012 s
% 7.67/2.41 # ...preprocessing : 0.010 s
% 7.67/2.41 # ...main loop : 0.002 s
% 7.67/2.41 # Maximum resident set size: 7128 pages
% 7.67/2.41
%------------------------------------------------------------------------------