TSTP Solution File: GEO251+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO251+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:54 EDT 2022
% Result : Theorem 7.68s 2.38s
% Output : CNFRefutation 7.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 8 RR)
% Number of literals : 10 ( 0 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 10 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( left_apart_point(X1,reverse_line(X2))
| ~ right_apart_point(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-97u2cfxp/input.p',i_0_4) ).
cnf(i_0_30,plain,
~ left_apart_point(X1,X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-97u2cfxp/input.p',i_0_30) ).
cnf(i_0_68,negated_conjecture,
right_apart_point(esk2_0,parallel_through_point(esk3_0,esk1_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-97u2cfxp/input.p',i_0_68) ).
cnf(c_0_72,plain,
( left_apart_point(X1,reverse_line(X2))
| ~ right_apart_point(X1,X2) ),
i_0_4 ).
cnf(c_0_73,plain,
~ left_apart_point(X1,X2),
i_0_30 ).
cnf(c_0_74,negated_conjecture,
right_apart_point(esk2_0,parallel_through_point(esk3_0,esk1_0)),
i_0_68 ).
cnf(c_0_75,plain,
~ right_apart_point(X1,X2),
inference(sr,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_74,c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO251+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n022.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 12:54:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.68/2.38 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.68/2.38 # Version: 2.1pre011
% 7.68/2.38 # Preprocessing time : 0.017 s
% 7.68/2.38
% 7.68/2.38 # Proof found!
% 7.68/2.38 # SZS status Theorem
% 7.68/2.38 # SZS output start CNFRefutation
% See solution above
% 7.68/2.39 # Proof object total steps : 8
% 7.68/2.39 # Proof object clause steps : 5
% 7.68/2.39 # Proof object formula steps : 3
% 7.68/2.39 # Proof object conjectures : 3
% 7.68/2.39 # Proof object clause conjectures : 2
% 7.68/2.39 # Proof object formula conjectures : 1
% 7.68/2.39 # Proof object initial clauses used : 3
% 7.68/2.39 # Proof object initial formulas used : 3
% 7.68/2.39 # Proof object generating inferences : 0
% 7.68/2.39 # Proof object simplifying inferences : 2
% 7.68/2.39 # Training examples: 0 positive, 0 negative
% 7.68/2.39 # Parsed axioms : 68
% 7.68/2.39 # Removed by relevancy pruning/SinE : 0
% 7.68/2.39 # Initial clauses : 68
% 7.68/2.39 # Removed in clause preprocessing : 0
% 7.68/2.39 # Initial clauses in saturation : 68
% 7.68/2.39 # Processed clauses : 16
% 7.68/2.39 # ...of these trivial : 0
% 7.68/2.39 # ...subsumed : 4
% 7.68/2.39 # ...remaining for further processing : 12
% 7.68/2.39 # Other redundant clauses eliminated : 0
% 7.68/2.39 # Clauses deleted for lack of memory : 0
% 7.68/2.39 # Backward-subsumed : 0
% 7.68/2.39 # Backward-rewritten : 0
% 7.68/2.39 # Generated clauses : 1
% 7.68/2.39 # ...of the previous two non-trivial : 0
% 7.68/2.39 # Contextual simplify-reflections : 0
% 7.68/2.39 # Paramodulations : 0
% 7.68/2.39 # Factorizations : 0
% 7.68/2.39 # Equation resolutions : 0
% 7.68/2.39 # Propositional unsat checks : 0
% 7.68/2.39 # Propositional unsat check successes : 0
% 7.68/2.39 # Current number of processed clauses : 11
% 7.68/2.39 # Positive orientable unit clauses : 1
% 7.68/2.39 # Positive unorientable unit clauses: 0
% 7.68/2.39 # Negative unit clauses : 6
% 7.68/2.39 # Non-unit-clauses : 4
% 7.68/2.39 # Current number of unprocessed clauses: 52
% 7.68/2.39 # ...number of literals in the above : 154
% 7.68/2.39 # Current number of archived formulas : 0
% 7.68/2.39 # Current number of archived clauses : 1
% 7.68/2.39 # Clause-clause subsumption calls (NU) : 5
% 7.68/2.39 # Rec. Clause-clause subsumption calls : 5
% 7.68/2.39 # Non-unit clause-clause subsumptions : 0
% 7.68/2.39 # Unit Clause-clause subsumption calls : 6
% 7.68/2.39 # Rewrite failures with RHS unbound : 0
% 7.68/2.39 # BW rewrite match attempts : 0
% 7.68/2.39 # BW rewrite match successes : 0
% 7.68/2.39 # Condensation attempts : 0
% 7.68/2.39 # Condensation successes : 0
% 7.68/2.39 # Termbank termtop insertions : 1077
% 7.68/2.39
% 7.68/2.39 # -------------------------------------------------
% 7.68/2.39 # User time : 0.013 s
% 7.68/2.39 # System time : 0.005 s
% 7.68/2.39 # Total time : 0.018 s
% 7.68/2.39 # ...preprocessing : 0.017 s
% 7.68/2.39 # ...main loop : 0.000 s
% 7.68/2.39 # Maximum resident set size: 7132 pages
% 7.68/2.39
%------------------------------------------------------------------------------