TSTP Solution File: GEO206+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO206+3 : TPTP v8.1.0. Bugfixed v4.0.1.
% 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:24 EDT 2022
% Result : Theorem 6.85s 2.07s
% Output : CNFRefutation 6.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 10 unt; 5 nHn; 14 RR)
% Number of literals : 30 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 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 : 23 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_26,negated_conjecture,
~ equal_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b_5678_n/input.p',i_0_26) ).
cnf(i_0_14,plain,
( distinct_lines(X1,X2)
| equal_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b_5678_n/input.p',i_0_14) ).
cnf(i_0_48,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b_5678_n/input.p',i_0_48) ).
cnf(i_0_16,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b_5678_n/input.p',i_0_16) ).
cnf(i_0_2,plain,
( ~ parallel_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b_5678_n/input.p',i_0_2) ).
cnf(i_0_27,negated_conjecture,
parallel_lines(esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b_5678_n/input.p',i_0_27) ).
cnf(i_0_34,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b_5678_n/input.p',i_0_34) ).
cnf(c_0_56,negated_conjecture,
~ equal_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)),
i_0_26 ).
cnf(c_0_57,plain,
( distinct_lines(X1,X2)
| equal_lines(X1,X2) ),
i_0_14 ).
cnf(c_0_58,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
i_0_48 ).
cnf(c_0_59,negated_conjecture,
distinct_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_16 ).
cnf(c_0_61,plain,
convergent_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,plain,
( ~ parallel_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
i_0_2 ).
cnf(c_0_63,negated_conjecture,
parallel_lines(esk2_0,esk3_0),
i_0_27 ).
cnf(c_0_64,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
i_0_34 ).
cnf(c_0_65,plain,
( convergent_lines(parallel_through_point(esk3_0,esk1_0),X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
~ convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GEO206+3 : TPTP v8.1.0. Bugfixed v4.0.1.
% 0.00/0.09 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Sat Jun 18 15:30:48 EDT 2022
% 0.09/0.28 % CPUTime :
% 0.13/0.36 # ENIGMATIC: Selected SinE mode:
% 0.13/0.37 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.13/0.37 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.13/0.37 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.85/2.07 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 6.85/2.07 # Version: 2.1pre011
% 6.85/2.07 # Preprocessing time : 0.010 s
% 6.85/2.07
% 6.85/2.07 # Proof found!
% 6.85/2.07 # SZS status Theorem
% 6.85/2.07 # SZS output start CNFRefutation
% See solution above
% 6.85/2.07 # Proof object total steps : 19
% 6.85/2.07 # Proof object clause steps : 12
% 6.85/2.07 # Proof object formula steps : 7
% 6.85/2.07 # Proof object conjectures : 6
% 6.85/2.07 # Proof object clause conjectures : 4
% 6.85/2.07 # Proof object formula conjectures : 2
% 6.85/2.07 # Proof object initial clauses used : 7
% 6.85/2.07 # Proof object initial formulas used : 7
% 6.85/2.07 # Proof object generating inferences : 5
% 6.85/2.07 # Proof object simplifying inferences : 1
% 6.85/2.07 # Training examples: 0 positive, 0 negative
% 6.85/2.07 # Parsed axioms : 49
% 6.85/2.07 # Removed by relevancy pruning/SinE : 0
% 6.85/2.07 # Initial clauses : 49
% 6.85/2.07 # Removed in clause preprocessing : 0
% 6.85/2.07 # Initial clauses in saturation : 49
% 6.85/2.07 # Processed clauses : 57
% 6.85/2.07 # ...of these trivial : 0
% 6.85/2.07 # ...subsumed : 4
% 6.85/2.07 # ...remaining for further processing : 53
% 6.85/2.07 # Other redundant clauses eliminated : 0
% 6.85/2.07 # Clauses deleted for lack of memory : 0
% 6.85/2.07 # Backward-subsumed : 0
% 6.85/2.07 # Backward-rewritten : 0
% 6.85/2.07 # Generated clauses : 42
% 6.85/2.07 # ...of the previous two non-trivial : 28
% 6.85/2.07 # Contextual simplify-reflections : 4
% 6.85/2.07 # Paramodulations : 42
% 6.85/2.07 # Factorizations : 0
% 6.85/2.07 # Equation resolutions : 0
% 6.85/2.07 # Propositional unsat checks : 0
% 6.85/2.07 # Propositional unsat check successes : 0
% 6.85/2.07 # Current number of processed clauses : 53
% 6.85/2.07 # Positive orientable unit clauses : 5
% 6.85/2.07 # Positive unorientable unit clauses: 0
% 6.85/2.07 # Negative unit clauses : 10
% 6.85/2.07 # Non-unit-clauses : 38
% 6.85/2.07 # Current number of unprocessed clauses: 17
% 6.85/2.07 # ...number of literals in the above : 58
% 6.85/2.07 # Current number of archived formulas : 0
% 6.85/2.07 # Current number of archived clauses : 0
% 6.85/2.07 # Clause-clause subsumption calls (NU) : 265
% 6.85/2.07 # Rec. Clause-clause subsumption calls : 143
% 6.85/2.07 # Non-unit clause-clause subsumptions : 8
% 6.85/2.07 # Unit Clause-clause subsumption calls : 34
% 6.85/2.07 # Rewrite failures with RHS unbound : 0
% 6.85/2.07 # BW rewrite match attempts : 0
% 6.85/2.07 # BW rewrite match successes : 0
% 6.85/2.07 # Condensation attempts : 0
% 6.85/2.07 # Condensation successes : 0
% 6.85/2.07 # Termbank termtop insertions : 1478
% 6.85/2.07
% 6.85/2.07 # -------------------------------------------------
% 6.85/2.07 # User time : 0.009 s
% 6.85/2.07 # System time : 0.003 s
% 6.85/2.07 # Total time : 0.011 s
% 6.85/2.07 # ...preprocessing : 0.010 s
% 6.85/2.07 # ...main loop : 0.001 s
% 6.85/2.07 # Maximum resident set size: 7124 pages
% 6.85/2.07
%------------------------------------------------------------------------------