TSTP Solution File: GEO206+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO206+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:23 EDT 2022
% Result : Theorem 6.22s 1.95s
% Output : CNFRefutation 6.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 11 unt; 7 nHn; 11 RR)
% Number of literals : 34 ( 0 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_20,plain,
( convergent_lines(X1,X2)
| apart_point_and_line(X3,X2)
| apart_point_and_line(X3,X1)
| ~ distinct_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v5p04jcx/input.p',i_0_20) ).
cnf(i_0_14,negated_conjecture,
distinct_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v5p04jcx/input.p',i_0_14) ).
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-v5p04jcx/input.p',i_0_6) ).
cnf(i_0_17,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v5p04jcx/input.p',i_0_17) ).
cnf(i_0_15,negated_conjecture,
~ convergent_lines(esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v5p04jcx/input.p',i_0_15) ).
cnf(i_0_18,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v5p04jcx/input.p',i_0_18) ).
cnf(i_0_16,negated_conjecture,
~ apart_point_and_line(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v5p04jcx/input.p',i_0_16) ).
cnf(c_0_28,plain,
( convergent_lines(X1,X2)
| apart_point_and_line(X3,X2)
| apart_point_and_line(X3,X1)
| ~ distinct_lines(X1,X2) ),
i_0_20 ).
cnf(c_0_29,negated_conjecture,
distinct_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)),
i_0_14 ).
cnf(c_0_30,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_6 ).
cnf(c_0_31,negated_conjecture,
( apart_point_and_line(X1,parallel_through_point(esk3_0,esk1_0))
| apart_point_and_line(X1,esk2_0)
| convergent_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
i_0_17 ).
cnf(c_0_33,plain,
( apart_point_and_line(X1,parallel_through_point(esk3_0,esk1_0))
| apart_point_and_line(X1,esk2_0)
| convergent_lines(parallel_through_point(esk3_0,esk1_0),X2)
| convergent_lines(esk2_0,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
~ convergent_lines(esk2_0,esk3_0),
i_0_15 ).
cnf(c_0_35,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
i_0_18 ).
cnf(c_0_36,plain,
( apart_point_and_line(X1,parallel_through_point(esk3_0,esk1_0))
| apart_point_and_line(X1,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
~ apart_point_and_line(esk1_0,esk2_0),
i_0_16 ).
cnf(c_0_38,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO206+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 18 02:22:41 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.22/1.95 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 6.22/1.95 # Version: 2.1pre011
% 6.22/1.95 # Preprocessing time : 0.009 s
% 6.22/1.95
% 6.22/1.95 # Proof found!
% 6.22/1.95 # SZS status Theorem
% 6.22/1.95 # SZS output start CNFRefutation
% See solution above
% 6.22/1.95 # Proof object total steps : 18
% 6.22/1.95 # Proof object clause steps : 11
% 6.22/1.95 # Proof object formula steps : 7
% 6.22/1.95 # Proof object conjectures : 7
% 6.22/1.95 # Proof object clause conjectures : 4
% 6.22/1.95 # Proof object formula conjectures : 3
% 6.22/1.95 # Proof object initial clauses used : 7
% 6.22/1.95 # Proof object initial formulas used : 7
% 6.22/1.95 # Proof object generating inferences : 4
% 6.22/1.95 # Proof object simplifying inferences : 2
% 6.22/1.95 # Training examples: 0 positive, 0 negative
% 6.22/1.95 # Parsed axioms : 20
% 6.22/1.95 # Removed by relevancy pruning/SinE : 0
% 6.22/1.95 # Initial clauses : 20
% 6.22/1.95 # Removed in clause preprocessing : 0
% 6.22/1.95 # Initial clauses in saturation : 20
% 6.22/1.95 # Processed clauses : 61
% 6.22/1.95 # ...of these trivial : 0
% 6.22/1.95 # ...subsumed : 10
% 6.22/1.95 # ...remaining for further processing : 51
% 6.22/1.95 # Other redundant clauses eliminated : 0
% 6.22/1.95 # Clauses deleted for lack of memory : 0
% 6.22/1.95 # Backward-subsumed : 4
% 6.22/1.95 # Backward-rewritten : 2
% 6.22/1.95 # Generated clauses : 271
% 6.22/1.95 # ...of the previous two non-trivial : 250
% 6.22/1.95 # Contextual simplify-reflections : 0
% 6.22/1.95 # Paramodulations : 219
% 6.22/1.95 # Factorizations : 52
% 6.22/1.95 # Equation resolutions : 0
% 6.22/1.95 # Propositional unsat checks : 0
% 6.22/1.95 # Propositional unsat check successes : 0
% 6.22/1.95 # Current number of processed clauses : 45
% 6.22/1.95 # Positive orientable unit clauses : 2
% 6.22/1.95 # Positive unorientable unit clauses: 0
% 6.22/1.95 # Negative unit clauses : 7
% 6.22/1.95 # Non-unit-clauses : 36
% 6.22/1.95 # Current number of unprocessed clauses: 176
% 6.22/1.95 # ...number of literals in the above : 829
% 6.22/1.95 # Current number of archived formulas : 0
% 6.22/1.95 # Current number of archived clauses : 6
% 6.22/1.95 # Clause-clause subsumption calls (NU) : 335
% 6.22/1.95 # Rec. Clause-clause subsumption calls : 156
% 6.22/1.95 # Non-unit clause-clause subsumptions : 12
% 6.22/1.95 # Unit Clause-clause subsumption calls : 11
% 6.22/1.95 # Rewrite failures with RHS unbound : 0
% 6.22/1.95 # BW rewrite match attempts : 1
% 6.22/1.95 # BW rewrite match successes : 1
% 6.22/1.95 # Condensation attempts : 0
% 6.22/1.95 # Condensation successes : 0
% 6.22/1.95 # Termbank termtop insertions : 3337
% 6.22/1.95
% 6.22/1.95 # -------------------------------------------------
% 6.22/1.95 # User time : 0.011 s
% 6.22/1.95 # System time : 0.002 s
% 6.22/1.95 # Total time : 0.013 s
% 6.22/1.95 # ...preprocessing : 0.009 s
% 6.22/1.95 # ...main loop : 0.004 s
% 6.22/1.95 # Maximum resident set size: 7132 pages
% 6.22/1.95
%------------------------------------------------------------------------------