TSTP Solution File: GEO190+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO190+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:09 EDT 2022
% Result : Theorem 8.31s 2.53s
% Output : CNFRefutation 8.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 11 unt; 10 nHn; 12 RR)
% Number of literals : 40 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_26,negated_conjecture,
~ incident_point_and_line(esk3_0,line_connecting(esk2_0,esk1_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z1rg8yyw/input.p',i_0_26) ).
cnf(i_0_3,plain,
( incident_point_and_line(X1,X2)
| apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z1rg8yyw/input.p',i_0_3) ).
cnf(i_0_18,plain,
( apart_point_and_line(X1,X2)
| distinct_lines(X3,X2)
| ~ apart_point_and_line(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z1rg8yyw/input.p',i_0_18) ).
cnf(i_0_11,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z1rg8yyw/input.p',i_0_11) ).
cnf(i_0_8,plain,
~ distinct_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z1rg8yyw/input.p',i_0_8) ).
cnf(i_0_50,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z1rg8yyw/input.p',i_0_50) ).
cnf(i_0_36,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z1rg8yyw/input.p',i_0_36) ).
cnf(i_0_37,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z1rg8yyw/input.p',i_0_37) ).
cnf(c_0_59,negated_conjecture,
~ incident_point_and_line(esk3_0,line_connecting(esk2_0,esk1_0)),
i_0_26 ).
cnf(c_0_60,plain,
( incident_point_and_line(X1,X2)
| apart_point_and_line(X1,X2) ),
i_0_3 ).
cnf(c_0_61,plain,
( apart_point_and_line(X1,X2)
| distinct_lines(X3,X2)
| ~ apart_point_and_line(X1,X3) ),
i_0_18 ).
cnf(c_0_62,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk2_0,esk1_0)),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
i_0_11 ).
cnf(c_0_64,plain,
( apart_point_and_line(esk3_0,X1)
| distinct_lines(line_connecting(esk2_0,esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,plain,
~ distinct_lines(X1,X1),
i_0_8 ).
cnf(c_0_66,plain,
( apart_point_and_line(esk3_0,X1)
| distinct_lines(line_connecting(esk2_0,esk1_0),X2)
| distinct_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
i_0_50 ).
cnf(c_0_68,plain,
( apart_point_and_line(esk3_0,X1)
| distinct_lines(X1,line_connecting(esk2_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
i_0_36 ).
cnf(c_0_70,plain,
( apart_point_and_line(esk3_0,X1)
| convergent_lines(X1,line_connecting(esk2_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
i_0_37 ).
cnf(c_0_72,plain,
apart_point_and_line(esk3_0,parallel_through_point(line_connecting(esk2_0,esk1_0),X1)),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,plain,
$false,
inference(spm,[status(thm)],[c_0_71,c_0_72]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO190+3 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Fri Jun 17 20:08:43 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.31/2.53 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.31/2.53 # Version: 2.1pre011
% 8.31/2.53 # Preprocessing time : 0.013 s
% 8.31/2.53
% 8.31/2.53 # Proof found!
% 8.31/2.53 # SZS status Theorem
% 8.31/2.53 # SZS output start CNFRefutation
% See solution above
% 8.31/2.53 # Proof object total steps : 23
% 8.31/2.53 # Proof object clause steps : 15
% 8.31/2.53 # Proof object formula steps : 8
% 8.31/2.53 # Proof object conjectures : 3
% 8.31/2.53 # Proof object clause conjectures : 2
% 8.31/2.53 # Proof object formula conjectures : 1
% 8.31/2.53 # Proof object initial clauses used : 8
% 8.31/2.53 # Proof object initial formulas used : 8
% 8.31/2.53 # Proof object generating inferences : 7
% 8.31/2.53 # Proof object simplifying inferences : 0
% 8.31/2.53 # Training examples: 0 positive, 0 negative
% 8.31/2.53 # Parsed axioms : 51
% 8.31/2.53 # Removed by relevancy pruning/SinE : 0
% 8.31/2.53 # Initial clauses : 51
% 8.31/2.53 # Removed in clause preprocessing : 0
% 8.31/2.53 # Initial clauses in saturation : 51
% 8.31/2.53 # Processed clauses : 127
% 8.31/2.53 # ...of these trivial : 2
% 8.31/2.53 # ...subsumed : 37
% 8.31/2.53 # ...remaining for further processing : 88
% 8.31/2.53 # Other redundant clauses eliminated : 0
% 8.31/2.53 # Clauses deleted for lack of memory : 0
% 8.31/2.53 # Backward-subsumed : 0
% 8.31/2.53 # Backward-rewritten : 2
% 8.31/2.53 # Generated clauses : 273
% 8.31/2.53 # ...of the previous two non-trivial : 216
% 8.31/2.53 # Contextual simplify-reflections : 4
% 8.31/2.53 # Paramodulations : 195
% 8.31/2.53 # Factorizations : 78
% 8.31/2.53 # Equation resolutions : 0
% 8.31/2.53 # Propositional unsat checks : 0
% 8.31/2.53 # Propositional unsat check successes : 0
% 8.31/2.53 # Current number of processed clauses : 86
% 8.31/2.53 # Positive orientable unit clauses : 10
% 8.31/2.53 # Positive unorientable unit clauses: 0
% 8.31/2.53 # Negative unit clauses : 9
% 8.31/2.53 # Non-unit-clauses : 67
% 8.31/2.53 # Current number of unprocessed clauses: 136
% 8.31/2.53 # ...number of literals in the above : 511
% 8.31/2.53 # Current number of archived formulas : 0
% 8.31/2.53 # Current number of archived clauses : 2
% 8.31/2.53 # Clause-clause subsumption calls (NU) : 1033
% 8.31/2.53 # Rec. Clause-clause subsumption calls : 585
% 8.31/2.53 # Non-unit clause-clause subsumptions : 31
% 8.31/2.53 # Unit Clause-clause subsumption calls : 36
% 8.31/2.53 # Rewrite failures with RHS unbound : 0
% 8.31/2.53 # BW rewrite match attempts : 1
% 8.31/2.53 # BW rewrite match successes : 1
% 8.31/2.53 # Condensation attempts : 0
% 8.31/2.53 # Condensation successes : 0
% 8.31/2.53 # Termbank termtop insertions : 3398
% 8.31/2.53
% 8.31/2.53 # -------------------------------------------------
% 8.31/2.53 # User time : 0.013 s
% 8.31/2.53 # System time : 0.003 s
% 8.31/2.53 # Total time : 0.017 s
% 8.31/2.53 # ...preprocessing : 0.013 s
% 8.31/2.53 # ...main loop : 0.004 s
% 8.31/2.53 # Maximum resident set size: 7140 pages
% 8.31/2.53
%------------------------------------------------------------------------------