TSTP Solution File: GEO175+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO175+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:56 EDT 2022
% Result : Theorem 8.75s 2.50s
% Output : CNFRefutation 8.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 11 unt; 8 nHn; 17 RR)
% Number of literals : 52 ( 0 equ; 21 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( distinct_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0gwjd4sc/input.p',i_0_9) ).
cnf(i_0_17,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0gwjd4sc/input.p',i_0_17) ).
cnf(i_0_19,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-0gwjd4sc/input.p',i_0_19) ).
cnf(i_0_16,negated_conjecture,
distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0gwjd4sc/input.p',i_0_16) ).
cnf(i_0_14,negated_conjecture,
~ apart_point_and_line(esk1_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0gwjd4sc/input.p',i_0_14) ).
cnf(i_0_13,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0gwjd4sc/input.p',i_0_13) ).
cnf(i_0_12,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0gwjd4sc/input.p',i_0_12) ).
cnf(i_0_15,negated_conjecture,
~ apart_point_and_line(esk1_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0gwjd4sc/input.p',i_0_15) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0gwjd4sc/input.p',i_0_3) ).
cnf(c_0_29,plain,
( distinct_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_9 ).
cnf(c_0_30,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
i_0_17 ).
cnf(c_0_31,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_19 ).
cnf(c_0_32,negated_conjecture,
( distinct_lines(esk4_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( apart_point_and_line(X1,esk4_0)
| apart_point_and_line(X2,esk4_0)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,X3)
| convergent_lines(esk3_0,X3)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
i_0_16 ).
cnf(c_0_35,negated_conjecture,
~ apart_point_and_line(esk1_0,esk4_0),
i_0_14 ).
cnf(c_0_36,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
i_0_13 ).
cnf(c_0_37,negated_conjecture,
( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0)
| apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)
| apart_point_and_line(esk1_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_38,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
i_0_12 ).
cnf(c_0_39,plain,
( apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)
| apart_point_and_line(esk1_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_30])]) ).
cnf(c_0_40,negated_conjecture,
~ apart_point_and_line(esk1_0,esk3_0),
i_0_15 ).
cnf(c_0_41,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_42,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_30])]),c_0_40]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO175+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 : n007.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 01:07:44 EDT 2022
% 0.13/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
% 8.75/2.50 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.75/2.50 # Version: 2.1pre011
% 8.75/2.50 # Preprocessing time : 0.012 s
% 8.75/2.50
% 8.75/2.50 # Proof found!
% 8.75/2.50 # SZS status Theorem
% 8.75/2.50 # SZS output start CNFRefutation
% See solution above
% 8.75/2.50 # Proof object total steps : 23
% 8.75/2.50 # Proof object clause steps : 14
% 8.75/2.50 # Proof object formula steps : 9
% 8.75/2.50 # Proof object conjectures : 10
% 8.75/2.50 # Proof object clause conjectures : 6
% 8.75/2.50 # Proof object formula conjectures : 4
% 8.75/2.50 # Proof object initial clauses used : 9
% 8.75/2.50 # Proof object initial formulas used : 9
% 8.75/2.50 # Proof object generating inferences : 5
% 8.75/2.50 # Proof object simplifying inferences : 7
% 8.75/2.50 # Training examples: 0 positive, 0 negative
% 8.75/2.50 # Parsed axioms : 19
% 8.75/2.50 # Removed by relevancy pruning/SinE : 0
% 8.75/2.50 # Initial clauses : 19
% 8.75/2.50 # Removed in clause preprocessing : 0
% 8.75/2.50 # Initial clauses in saturation : 19
% 8.75/2.50 # Processed clauses : 184
% 8.75/2.50 # ...of these trivial : 0
% 8.75/2.50 # ...subsumed : 107
% 8.75/2.50 # ...remaining for further processing : 77
% 8.75/2.50 # Other redundant clauses eliminated : 0
% 8.75/2.50 # Clauses deleted for lack of memory : 0
% 8.75/2.50 # Backward-subsumed : 1
% 8.75/2.50 # Backward-rewritten : 0
% 8.75/2.50 # Generated clauses : 571
% 8.75/2.50 # ...of the previous two non-trivial : 480
% 8.75/2.50 # Contextual simplify-reflections : 16
% 8.75/2.50 # Paramodulations : 393
% 8.75/2.50 # Factorizations : 178
% 8.75/2.50 # Equation resolutions : 0
% 8.75/2.50 # Propositional unsat checks : 0
% 8.75/2.50 # Propositional unsat check successes : 0
% 8.75/2.50 # Current number of processed clauses : 76
% 8.75/2.50 # Positive orientable unit clauses : 5
% 8.75/2.50 # Positive unorientable unit clauses: 0
% 8.75/2.50 # Negative unit clauses : 5
% 8.75/2.50 # Non-unit-clauses : 66
% 8.75/2.50 # Current number of unprocessed clauses: 306
% 8.75/2.50 # ...number of literals in the above : 1509
% 8.75/2.50 # Current number of archived formulas : 0
% 8.75/2.50 # Current number of archived clauses : 1
% 8.75/2.50 # Clause-clause subsumption calls (NU) : 1359
% 8.75/2.50 # Rec. Clause-clause subsumption calls : 770
% 8.75/2.50 # Non-unit clause-clause subsumptions : 103
% 8.75/2.50 # Unit Clause-clause subsumption calls : 14
% 8.75/2.50 # Rewrite failures with RHS unbound : 0
% 8.75/2.50 # BW rewrite match attempts : 0
% 8.75/2.50 # BW rewrite match successes : 0
% 8.75/2.50 # Condensation attempts : 0
% 8.75/2.50 # Condensation successes : 0
% 8.75/2.50 # Termbank termtop insertions : 6278
% 8.75/2.50
% 8.75/2.50 # -------------------------------------------------
% 8.75/2.50 # User time : 0.014 s
% 8.75/2.50 # System time : 0.005 s
% 8.75/2.50 # Total time : 0.020 s
% 8.75/2.50 # ...preprocessing : 0.012 s
% 8.75/2.50 # ...main loop : 0.007 s
% 8.75/2.50 # Maximum resident set size: 7132 pages
% 8.75/2.50
%------------------------------------------------------------------------------