TSTP Solution File: GEO217+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO217+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:32 EDT 2022
% Result : Theorem 7.42s 2.35s
% Output : CNFRefutation 7.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 13 unt; 8 nHn; 15 RR)
% Number of literals : 36 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_26,negated_conjecture,
~ parallel_lines(esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z21e9do5/input.p',i_0_26) ).
cnf(i_0_1,plain,
( parallel_lines(X1,X2)
| convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z21e9do5/input.p',i_0_1) ).
cnf(i_0_16,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z21e9do5/input.p',i_0_16) ).
cnf(i_0_2,plain,
( ~ parallel_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z21e9do5/input.p',i_0_2) ).
cnf(i_0_27,negated_conjecture,
parallel_lines(esk1_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z21e9do5/input.p',i_0_27) ).
cnf(i_0_9,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z21e9do5/input.p',i_0_9) ).
cnf(i_0_28,negated_conjecture,
parallel_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z21e9do5/input.p',i_0_28) ).
cnf(c_0_36,negated_conjecture,
~ parallel_lines(esk2_0,esk3_0),
i_0_26 ).
cnf(c_0_37,plain,
( parallel_lines(X1,X2)
| convergent_lines(X1,X2) ),
i_0_1 ).
cnf(c_0_38,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_16 ).
cnf(c_0_39,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,plain,
( ~ parallel_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
i_0_2 ).
cnf(c_0_42,negated_conjecture,
parallel_lines(esk1_0,esk3_0),
i_0_27 ).
cnf(c_0_43,plain,
~ convergent_lines(X1,X1),
i_0_9 ).
cnf(c_0_44,plain,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk3_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
~ convergent_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( convergent_lines(X1,esk3_0)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
parallel_lines(esk1_0,esk2_0),
i_0_28 ).
cnf(c_0_48,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
~ convergent_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_41,c_0_47]) ).
cnf(c_0_50,plain,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO217+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 08:43:41 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/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
% 7.42/2.35 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.42/2.35 # Version: 2.1pre011
% 7.42/2.35 # Preprocessing time : 0.010 s
% 7.42/2.35
% 7.42/2.35 # Proof found!
% 7.42/2.35 # SZS status Theorem
% 7.42/2.35 # SZS output start CNFRefutation
% See solution above
% 7.42/2.35 # Proof object total steps : 23
% 7.42/2.35 # Proof object clause steps : 16
% 7.42/2.35 # Proof object formula steps : 7
% 7.42/2.35 # Proof object conjectures : 11
% 7.42/2.35 # Proof object clause conjectures : 8
% 7.42/2.35 # Proof object formula conjectures : 3
% 7.42/2.35 # Proof object initial clauses used : 7
% 7.42/2.35 # Proof object initial formulas used : 7
% 7.42/2.35 # Proof object generating inferences : 9
% 7.42/2.35 # Proof object simplifying inferences : 1
% 7.42/2.35 # Training examples: 0 positive, 0 negative
% 7.42/2.35 # Parsed axioms : 49
% 7.42/2.35 # Removed by relevancy pruning/SinE : 0
% 7.42/2.35 # Initial clauses : 49
% 7.42/2.35 # Removed in clause preprocessing : 0
% 7.42/2.35 # Initial clauses in saturation : 49
% 7.42/2.35 # Processed clauses : 93
% 7.42/2.35 # ...of these trivial : 0
% 7.42/2.35 # ...subsumed : 11
% 7.42/2.35 # ...remaining for further processing : 82
% 7.42/2.35 # Other redundant clauses eliminated : 0
% 7.42/2.35 # Clauses deleted for lack of memory : 0
% 7.42/2.35 # Backward-subsumed : 1
% 7.42/2.35 # Backward-rewritten : 1
% 7.42/2.35 # Generated clauses : 232
% 7.42/2.35 # ...of the previous two non-trivial : 189
% 7.42/2.35 # Contextual simplify-reflections : 5
% 7.42/2.35 # Paramodulations : 226
% 7.42/2.35 # Factorizations : 6
% 7.42/2.35 # Equation resolutions : 0
% 7.42/2.35 # Propositional unsat checks : 0
% 7.42/2.35 # Propositional unsat check successes : 0
% 7.42/2.35 # Current number of processed clauses : 80
% 7.42/2.35 # Positive orientable unit clauses : 11
% 7.42/2.35 # Positive unorientable unit clauses: 0
% 7.42/2.35 # Negative unit clauses : 10
% 7.42/2.35 # Non-unit-clauses : 59
% 7.42/2.35 # Current number of unprocessed clauses: 126
% 7.42/2.35 # ...number of literals in the above : 478
% 7.42/2.35 # Current number of archived formulas : 0
% 7.42/2.35 # Current number of archived clauses : 2
% 7.42/2.35 # Clause-clause subsumption calls (NU) : 701
% 7.42/2.35 # Rec. Clause-clause subsumption calls : 442
% 7.42/2.35 # Non-unit clause-clause subsumptions : 15
% 7.42/2.35 # Unit Clause-clause subsumption calls : 140
% 7.42/2.35 # Rewrite failures with RHS unbound : 0
% 7.42/2.35 # BW rewrite match attempts : 1
% 7.42/2.35 # BW rewrite match successes : 1
% 7.42/2.35 # Condensation attempts : 0
% 7.42/2.35 # Condensation successes : 0
% 7.42/2.35 # Termbank termtop insertions : 3669
% 7.42/2.35
% 7.42/2.35 # -------------------------------------------------
% 7.42/2.35 # User time : 0.010 s
% 7.42/2.35 # System time : 0.004 s
% 7.42/2.35 # Total time : 0.014 s
% 7.42/2.35 # ...preprocessing : 0.010 s
% 7.42/2.35 # ...main loop : 0.004 s
% 7.42/2.35 # Maximum resident set size: 7128 pages
% 7.42/2.35
%------------------------------------------------------------------------------