TSTP Solution File: GEO201+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO201+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:44:19 EDT 2022
% Result : Theorem 6.43s 2.36s
% Output : CNFRefutation 6.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 9 unt; 12 nHn; 17 RR)
% Number of literals : 61 ( 0 equ; 19 neg)
% Maximal clause size : 6 ( 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 : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( distinct_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cevn_0q/input.p',i_0_9) ).
cnf(i_0_15,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cevn_0q/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/sandbox2/tmp/enigma-theBenchmark.p-_cevn_0q/input.p',i_0_16) ).
cnf(i_0_14,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cevn_0q/input.p',i_0_14) ).
cnf(i_0_12,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cevn_0q/input.p',i_0_12) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cevn_0q/input.p',i_0_3) ).
cnf(i_0_6,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cevn_0q/input.p',i_0_6) ).
cnf(i_0_13,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cevn_0q/input.p',i_0_13) ).
cnf(c_0_25,plain,
( distinct_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_9 ).
cnf(c_0_26,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_15 ).
cnf(c_0_27,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_28,negated_conjecture,
( distinct_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X2,esk2_0)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,X3)
| convergent_lines(esk1_0,X3)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)),
i_0_14 ).
cnf(c_0_31,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
i_0_12 ).
cnf(c_0_32,negated_conjecture,
( apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_34,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_6 ).
cnf(c_0_35,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
i_0_13 ).
cnf(c_0_36,plain,
( apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26])]),c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_26]) ).
cnf(c_0_38,plain,
( apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_26])]) ).
cnf(c_0_39,plain,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_33,c_0_37]) ).
cnf(c_0_40,plain,
apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_38]),c_0_39])]) ).
cnf(c_0_41,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_40]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GEO201+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 17 15:56:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.47 # ENIGMATIC: Selected SinE mode:
% 0.19/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.43/2.36 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 6.43/2.36 # Version: 2.1pre011
% 6.43/2.36 # Preprocessing time : 0.018 s
% 6.43/2.36
% 6.43/2.36 # Proof found!
% 6.43/2.36 # SZS status Theorem
% 6.43/2.36 # SZS output start CNFRefutation
% See solution above
% 6.43/2.36 # Proof object total steps : 25
% 6.43/2.36 # Proof object clause steps : 17
% 6.43/2.36 # Proof object formula steps : 8
% 6.43/2.36 # Proof object conjectures : 7
% 6.43/2.36 # Proof object clause conjectures : 5
% 6.43/2.36 # Proof object formula conjectures : 2
% 6.43/2.36 # Proof object initial clauses used : 8
% 6.43/2.36 # Proof object initial formulas used : 8
% 6.43/2.36 # Proof object generating inferences : 9
% 6.43/2.36 # Proof object simplifying inferences : 9
% 6.43/2.36 # Training examples: 0 positive, 0 negative
% 6.43/2.36 # Parsed axioms : 16
% 6.43/2.36 # Removed by relevancy pruning/SinE : 0
% 6.43/2.36 # Initial clauses : 16
% 6.43/2.36 # Removed in clause preprocessing : 0
% 6.43/2.36 # Initial clauses in saturation : 16
% 6.43/2.36 # Processed clauses : 92
% 6.43/2.36 # ...of these trivial : 2
% 6.43/2.36 # ...subsumed : 34
% 6.43/2.36 # ...remaining for further processing : 56
% 6.43/2.36 # Other redundant clauses eliminated : 0
% 6.43/2.36 # Clauses deleted for lack of memory : 0
% 6.43/2.36 # Backward-subsumed : 1
% 6.43/2.36 # Backward-rewritten : 2
% 6.43/2.36 # Generated clauses : 413
% 6.43/2.36 # ...of the previous two non-trivial : 369
% 6.43/2.36 # Contextual simplify-reflections : 4
% 6.43/2.36 # Paramodulations : 313
% 6.43/2.36 # Factorizations : 100
% 6.43/2.36 # Equation resolutions : 0
% 6.43/2.36 # Propositional unsat checks : 0
% 6.43/2.36 # Propositional unsat check successes : 0
% 6.43/2.36 # Current number of processed clauses : 53
% 6.43/2.36 # Positive orientable unit clauses : 5
% 6.43/2.36 # Positive unorientable unit clauses: 0
% 6.43/2.36 # Negative unit clauses : 3
% 6.43/2.36 # Non-unit-clauses : 45
% 6.43/2.36 # Current number of unprocessed clauses: 280
% 6.43/2.36 # ...number of literals in the above : 1524
% 6.43/2.36 # Current number of archived formulas : 0
% 6.43/2.36 # Current number of archived clauses : 3
% 6.43/2.36 # Clause-clause subsumption calls (NU) : 537
% 6.43/2.36 # Rec. Clause-clause subsumption calls : 350
% 6.43/2.36 # Non-unit clause-clause subsumptions : 39
% 6.43/2.36 # Unit Clause-clause subsumption calls : 3
% 6.43/2.36 # Rewrite failures with RHS unbound : 0
% 6.43/2.36 # BW rewrite match attempts : 1
% 6.43/2.36 # BW rewrite match successes : 1
% 6.43/2.36 # Condensation attempts : 0
% 6.43/2.36 # Condensation successes : 0
% 6.43/2.36 # Termbank termtop insertions : 5349
% 6.43/2.36
% 6.43/2.36 # -------------------------------------------------
% 6.43/2.36 # User time : 0.020 s
% 6.43/2.36 # System time : 0.009 s
% 6.43/2.36 # Total time : 0.029 s
% 6.43/2.36 # ...preprocessing : 0.018 s
% 6.43/2.36 # ...main loop : 0.011 s
% 6.43/2.36 # Maximum resident set size: 7136 pages
% 6.43/2.36
%------------------------------------------------------------------------------