TSTP Solution File: GEO192+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO192+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:10 EDT 2022
% Result : Theorem 8.16s 2.36s
% Output : CNFRefutation 8.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 11 unt; 7 nHn; 17 RR)
% Number of literals : 41 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 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 : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_18,plain,
( apart_point_and_line(X1,X2)
| distinct_lines(X3,X2)
| ~ apart_point_and_line(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-18shwbr7/input.p',i_0_18) ).
cnf(i_0_27,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-18shwbr7/input.p',i_0_27) ).
cnf(i_0_23,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-18shwbr7/input.p',i_0_23) ).
cnf(i_0_28,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-18shwbr7/input.p',i_0_28) ).
cnf(i_0_11,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-18shwbr7/input.p',i_0_11) ).
cnf(i_0_22,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-18shwbr7/input.p',i_0_22) ).
cnf(i_0_8,plain,
~ distinct_lines(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-18shwbr7/input.p',i_0_8) ).
cnf(i_0_26,negated_conjecture,
( ~ distinct_lines(esk1_0,esk3_0)
| ~ distinct_lines(esk2_0,esk3_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-18shwbr7/input.p',i_0_26) ).
cnf(c_0_37,plain,
( apart_point_and_line(X1,X2)
| distinct_lines(X3,X2)
| ~ apart_point_and_line(X1,X3) ),
i_0_18 ).
cnf(c_0_38,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
i_0_27 ).
cnf(c_0_39,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
i_0_23 ).
cnf(c_0_40,negated_conjecture,
( distinct_lines(esk3_0,X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_28 ).
cnf(c_0_42,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
i_0_11 ).
cnf(c_0_43,plain,
distinct_lines(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_44,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
i_0_22 ).
cnf(c_0_45,plain,
~ distinct_lines(X1,X1),
i_0_8 ).
cnf(c_0_46,plain,
( distinct_lines(esk3_0,X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
distinct_lines(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_40]),c_0_41])]) ).
cnf(c_0_48,negated_conjecture,
( ~ distinct_lines(esk1_0,esk3_0)
| ~ distinct_lines(esk2_0,esk3_0) ),
i_0_26 ).
cnf(c_0_49,plain,
distinct_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
( distinct_lines(esk3_0,X1)
| distinct_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
~ distinct_lines(esk1_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_52,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_50]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GEO192+3 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n013.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 18:15:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.16/2.36 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.16/2.36 # Version: 2.1pre011
% 8.16/2.36 # Preprocessing time : 0.020 s
% 8.16/2.36
% 8.16/2.36 # Proof found!
% 8.16/2.36 # SZS status Theorem
% 8.16/2.36 # SZS output start CNFRefutation
% See solution above
% 8.16/2.36 # Proof object total steps : 24
% 8.16/2.36 # Proof object clause steps : 16
% 8.16/2.36 # Proof object formula steps : 8
% 8.16/2.36 # Proof object conjectures : 8
% 8.16/2.36 # Proof object clause conjectures : 5
% 8.16/2.36 # Proof object formula conjectures : 3
% 8.16/2.36 # Proof object initial clauses used : 8
% 8.16/2.36 # Proof object initial formulas used : 8
% 8.16/2.36 # Proof object generating inferences : 7
% 8.16/2.36 # Proof object simplifying inferences : 7
% 8.16/2.36 # Training examples: 0 positive, 0 negative
% 8.16/2.36 # Parsed axioms : 49
% 8.16/2.36 # Removed by relevancy pruning/SinE : 0
% 8.16/2.36 # Initial clauses : 49
% 8.16/2.36 # Removed in clause preprocessing : 0
% 8.16/2.36 # Initial clauses in saturation : 49
% 8.16/2.36 # Processed clauses : 90
% 8.16/2.36 # ...of these trivial : 1
% 8.16/2.36 # ...subsumed : 18
% 8.16/2.36 # ...remaining for further processing : 71
% 8.16/2.36 # Other redundant clauses eliminated : 0
% 8.16/2.36 # Clauses deleted for lack of memory : 0
% 8.16/2.36 # Backward-subsumed : 0
% 8.16/2.36 # Backward-rewritten : 1
% 8.16/2.36 # Generated clauses : 179
% 8.16/2.36 # ...of the previous two non-trivial : 155
% 8.16/2.36 # Contextual simplify-reflections : 4
% 8.16/2.36 # Paramodulations : 149
% 8.16/2.36 # Factorizations : 30
% 8.16/2.36 # Equation resolutions : 0
% 8.16/2.36 # Propositional unsat checks : 0
% 8.16/2.36 # Propositional unsat check successes : 0
% 8.16/2.36 # Current number of processed clauses : 70
% 8.16/2.36 # Positive orientable unit clauses : 12
% 8.16/2.36 # Positive unorientable unit clauses: 0
% 8.16/2.36 # Negative unit clauses : 8
% 8.16/2.36 # Non-unit-clauses : 50
% 8.16/2.36 # Current number of unprocessed clauses: 114
% 8.16/2.36 # ...number of literals in the above : 392
% 8.16/2.36 # Current number of archived formulas : 0
% 8.16/2.36 # Current number of archived clauses : 1
% 8.16/2.36 # Clause-clause subsumption calls (NU) : 378
% 8.16/2.36 # Rec. Clause-clause subsumption calls : 234
% 8.16/2.36 # Non-unit clause-clause subsumptions : 16
% 8.16/2.36 # Unit Clause-clause subsumption calls : 139
% 8.16/2.36 # Rewrite failures with RHS unbound : 0
% 8.16/2.36 # BW rewrite match attempts : 1
% 8.16/2.36 # BW rewrite match successes : 1
% 8.16/2.36 # Condensation attempts : 0
% 8.16/2.36 # Condensation successes : 0
% 8.16/2.36 # Termbank termtop insertions : 2668
% 8.16/2.36
% 8.16/2.36 # -------------------------------------------------
% 8.16/2.36 # User time : 0.018 s
% 8.16/2.36 # System time : 0.007 s
% 8.16/2.36 # Total time : 0.025 s
% 8.16/2.36 # ...preprocessing : 0.020 s
% 8.16/2.36 # ...main loop : 0.005 s
% 8.16/2.36 # Maximum resident set size: 7136 pages
% 8.16/2.36
%------------------------------------------------------------------------------