TSTP Solution File: GEO192+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO192+1 : TPTP v8.1.0. Released v3.3.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:10 EDT 2022
% Result : Theorem 6.65s 2.20s
% Output : CNFRefutation 6.65s
% 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_8,plain,
( distinct_lines(X1,X2)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x400vevb/input.p',i_0_8) ).
cnf(i_0_15,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x400vevb/input.p',i_0_15) ).
cnf(i_0_13,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x400vevb/input.p',i_0_13) ).
cnf(i_0_16,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x400vevb/input.p',i_0_16) ).
cnf(i_0_5,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x400vevb/input.p',i_0_5) ).
cnf(i_0_12,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x400vevb/input.p',i_0_12) ).
cnf(i_0_2,plain,
~ distinct_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x400vevb/input.p',i_0_2) ).
cnf(i_0_14,negated_conjecture,
( ~ distinct_lines(esk1_0,esk3_0)
| ~ distinct_lines(esk2_0,esk3_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x400vevb/input.p',i_0_14) ).
cnf(c_0_25,plain,
( distinct_lines(X1,X2)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X3,X1) ),
i_0_8 ).
cnf(c_0_26,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
i_0_15 ).
cnf(c_0_27,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
i_0_13 ).
cnf(c_0_28,negated_conjecture,
( distinct_lines(esk3_0,X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_16 ).
cnf(c_0_30,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
i_0_5 ).
cnf(c_0_31,plain,
distinct_lines(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_32,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
i_0_12 ).
cnf(c_0_33,plain,
~ distinct_lines(X1,X1),
i_0_2 ).
cnf(c_0_34,plain,
( distinct_lines(esk3_0,X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
distinct_lines(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_28]),c_0_29])]) ).
cnf(c_0_36,negated_conjecture,
( ~ distinct_lines(esk1_0,esk3_0)
| ~ distinct_lines(esk2_0,esk3_0) ),
i_0_14 ).
cnf(c_0_37,plain,
distinct_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( distinct_lines(esk3_0,X1)
| distinct_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
~ distinct_lines(esk1_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_40,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GEO192+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n017.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sat Jun 18 04:46:29 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.43 # 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.65/2.20 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 6.65/2.20 # Version: 2.1pre011
% 6.65/2.20 # Preprocessing time : 0.010 s
% 6.65/2.20
% 6.65/2.20 # Proof found!
% 6.65/2.20 # SZS status Theorem
% 6.65/2.20 # SZS output start CNFRefutation
% See solution above
% 6.65/2.20 # Proof object total steps : 24
% 6.65/2.20 # Proof object clause steps : 16
% 6.65/2.20 # Proof object formula steps : 8
% 6.65/2.20 # Proof object conjectures : 8
% 6.65/2.20 # Proof object clause conjectures : 5
% 6.65/2.20 # Proof object formula conjectures : 3
% 6.65/2.20 # Proof object initial clauses used : 8
% 6.65/2.20 # Proof object initial formulas used : 8
% 6.65/2.20 # Proof object generating inferences : 7
% 6.65/2.20 # Proof object simplifying inferences : 7
% 6.65/2.20 # Training examples: 0 positive, 0 negative
% 6.65/2.20 # Parsed axioms : 17
% 6.65/2.20 # Removed by relevancy pruning/SinE : 0
% 6.65/2.20 # Initial clauses : 17
% 6.65/2.20 # Removed in clause preprocessing : 0
% 6.65/2.20 # Initial clauses in saturation : 17
% 6.65/2.20 # Processed clauses : 54
% 6.65/2.20 # ...of these trivial : 1
% 6.65/2.20 # ...subsumed : 6
% 6.65/2.20 # ...remaining for further processing : 47
% 6.65/2.20 # Other redundant clauses eliminated : 0
% 6.65/2.20 # Clauses deleted for lack of memory : 0
% 6.65/2.20 # Backward-subsumed : 0
% 6.65/2.20 # Backward-rewritten : 3
% 6.65/2.20 # Generated clauses : 149
% 6.65/2.20 # ...of the previous two non-trivial : 125
% 6.65/2.20 # Contextual simplify-reflections : 0
% 6.65/2.20 # Paramodulations : 133
% 6.65/2.20 # Factorizations : 16
% 6.65/2.20 # Equation resolutions : 0
% 6.65/2.20 # Propositional unsat checks : 0
% 6.65/2.20 # Propositional unsat check successes : 0
% 6.65/2.20 # Current number of processed clauses : 44
% 6.65/2.20 # Positive orientable unit clauses : 7
% 6.65/2.20 # Positive unorientable unit clauses: 0
% 6.65/2.20 # Negative unit clauses : 4
% 6.65/2.20 # Non-unit-clauses : 33
% 6.65/2.20 # Current number of unprocessed clauses: 84
% 6.65/2.20 # ...number of literals in the above : 349
% 6.65/2.20 # Current number of archived formulas : 0
% 6.65/2.20 # Current number of archived clauses : 3
% 6.65/2.20 # Clause-clause subsumption calls (NU) : 93
% 6.65/2.20 # Rec. Clause-clause subsumption calls : 66
% 6.65/2.20 # Non-unit clause-clause subsumptions : 6
% 6.65/2.20 # Unit Clause-clause subsumption calls : 39
% 6.65/2.20 # Rewrite failures with RHS unbound : 0
% 6.65/2.20 # BW rewrite match attempts : 1
% 6.65/2.20 # BW rewrite match successes : 1
% 6.65/2.20 # Condensation attempts : 0
% 6.65/2.20 # Condensation successes : 0
% 6.65/2.20 # Termbank termtop insertions : 1871
% 6.65/2.20
% 6.65/2.20 # -------------------------------------------------
% 6.65/2.20 # User time : 0.008 s
% 6.65/2.20 # System time : 0.004 s
% 6.65/2.20 # Total time : 0.012 s
% 6.65/2.20 # ...preprocessing : 0.010 s
% 6.65/2.20 # ...main loop : 0.002 s
% 6.65/2.20 # Maximum resident set size: 7132 pages
% 6.65/2.20
%------------------------------------------------------------------------------