TSTP Solution File: GEO226+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO226+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:40 EDT 2022
% Result : Theorem 7.46s 2.39s
% Output : CNFRefutation 7.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 7 unt; 6 nHn; 14 RR)
% Number of literals : 41 ( 0 equ; 20 neg)
% Maximal clause size : 3 ( 2 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-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0kikd5i/input.p',i_0_1) ).
cnf(i_0_13,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0kikd5i/input.p',i_0_13) ).
cnf(i_0_8,plain,
( distinct_lines(X1,X2)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0kikd5i/input.p',i_0_8) ).
cnf(i_0_15,negated_conjecture,
( apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X1,esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0kikd5i/input.p',i_0_15) ).
cnf(i_0_14,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0kikd5i/input.p',i_0_14) ).
cnf(i_0_2,plain,
~ distinct_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0kikd5i/input.p',i_0_2) ).
cnf(i_0_17,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0kikd5i/input.p',i_0_17) ).
cnf(c_0_25,plain,
~ distinct_points(X1,X1),
i_0_1 ).
cnf(c_0_26,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
i_0_13 ).
cnf(c_0_27,plain,
( distinct_lines(X1,X2)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X3,X1) ),
i_0_8 ).
cnf(c_0_28,negated_conjecture,
( apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X1,esk2_0) ),
i_0_15 ).
cnf(c_0_29,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X2) ),
i_0_14 ).
cnf(c_0_30,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X1,X2)
| distinct_lines(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( apart_point_and_line(intersection_point(X1,esk2_0),X2)
| distinct_lines(esk1_0,X2)
| ~ convergent_lines(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
~ distinct_lines(X1,X1),
i_0_2 ).
cnf(c_0_35,plain,
( distinct_lines(esk1_0,X1)
| ~ convergent_lines(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_17 ).
cnf(c_0_37,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GEO226+2 : TPTP v8.1.0. Released v3.3.0.
% 0.05/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Fri Jun 17 20:23:48 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.14/0.38 # ENIGMATIC: Selected SinE mode:
% 0.14/0.38 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.14/0.38 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.14/0.38 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.46/2.39 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.46/2.39 # Version: 2.1pre011
% 7.46/2.39 # Preprocessing time : 0.009 s
% 7.46/2.39
% 7.46/2.39 # Proof found!
% 7.46/2.39 # SZS status Theorem
% 7.46/2.39 # SZS output start CNFRefutation
% See solution above
% 7.46/2.39 # Proof object total steps : 20
% 7.46/2.39 # Proof object clause steps : 13
% 7.46/2.39 # Proof object formula steps : 7
% 7.46/2.39 # Proof object conjectures : 6
% 7.46/2.39 # Proof object clause conjectures : 4
% 7.46/2.39 # Proof object formula conjectures : 2
% 7.46/2.39 # Proof object initial clauses used : 7
% 7.46/2.39 # Proof object initial formulas used : 7
% 7.46/2.39 # Proof object generating inferences : 6
% 7.46/2.39 # Proof object simplifying inferences : 2
% 7.46/2.39 # Training examples: 0 positive, 0 negative
% 7.46/2.39 # Parsed axioms : 21
% 7.46/2.39 # Removed by relevancy pruning/SinE : 0
% 7.46/2.39 # Initial clauses : 21
% 7.46/2.39 # Removed in clause preprocessing : 0
% 7.46/2.39 # Initial clauses in saturation : 21
% 7.46/2.39 # Processed clauses : 42
% 7.46/2.39 # ...of these trivial : 1
% 7.46/2.39 # ...subsumed : 4
% 7.46/2.39 # ...remaining for further processing : 37
% 7.46/2.39 # Other redundant clauses eliminated : 0
% 7.46/2.39 # Clauses deleted for lack of memory : 0
% 7.46/2.39 # Backward-subsumed : 1
% 7.46/2.39 # Backward-rewritten : 1
% 7.46/2.39 # Generated clauses : 91
% 7.46/2.39 # ...of the previous two non-trivial : 81
% 7.46/2.39 # Contextual simplify-reflections : 0
% 7.46/2.39 # Paramodulations : 79
% 7.46/2.39 # Factorizations : 12
% 7.46/2.39 # Equation resolutions : 0
% 7.46/2.39 # Propositional unsat checks : 0
% 7.46/2.39 # Propositional unsat check successes : 0
% 7.46/2.39 # Current number of processed clauses : 35
% 7.46/2.39 # Positive orientable unit clauses : 5
% 7.46/2.39 # Positive unorientable unit clauses: 0
% 7.46/2.39 # Negative unit clauses : 3
% 7.46/2.39 # Non-unit-clauses : 27
% 7.46/2.39 # Current number of unprocessed clauses: 54
% 7.46/2.39 # ...number of literals in the above : 209
% 7.46/2.39 # Current number of archived formulas : 0
% 7.46/2.39 # Current number of archived clauses : 2
% 7.46/2.39 # Clause-clause subsumption calls (NU) : 85
% 7.46/2.39 # Rec. Clause-clause subsumption calls : 61
% 7.46/2.39 # Non-unit clause-clause subsumptions : 3
% 7.46/2.39 # Unit Clause-clause subsumption calls : 3
% 7.46/2.39 # Rewrite failures with RHS unbound : 0
% 7.46/2.39 # BW rewrite match attempts : 1
% 7.46/2.39 # BW rewrite match successes : 1
% 7.46/2.39 # Condensation attempts : 0
% 7.46/2.39 # Condensation successes : 0
% 7.46/2.39 # Termbank termtop insertions : 1309
% 7.46/2.39
% 7.46/2.39 # -------------------------------------------------
% 7.46/2.39 # User time : 0.009 s
% 7.46/2.39 # System time : 0.001 s
% 7.46/2.39 # Total time : 0.010 s
% 7.46/2.39 # ...preprocessing : 0.009 s
% 7.46/2.39 # ...main loop : 0.002 s
% 7.46/2.39 # Maximum resident set size: 7136 pages
% 7.46/2.39
%------------------------------------------------------------------------------