TSTP Solution File: GEO222+3 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : GEO222+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n016.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:37 EDT 2022

% Result   : Theorem 8.40s 2.49s
% Output   : CNFRefutation 8.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   30 (  12 unt;  18 nHn;   9 RR)
%            Number of literals    :   61 (   0 equ;  19 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   58 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_42,plain,
    ~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7r19rrd_/input.p',i_0_42) ).

cnf(i_0_24,plain,
    ( convergent_lines(X1,X2)
    | unorthogonal_lines(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7r19rrd_/input.p',i_0_24) ).

cnf(i_0_31,plain,
    ( unorthogonal_lines(X1,X2)
    | unorthogonal_lines(X1,X3)
    | ~ convergent_lines(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7r19rrd_/input.p',i_0_31) ).

cnf(i_0_26,negated_conjecture,
    ~ parallel_lines(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7r19rrd_/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-7r19rrd_/input.p',i_0_1) ).

cnf(i_0_37,plain,
    ( unorthogonal_lines(X1,X2)
    | unorthogonal_lines(X3,X2)
    | ~ convergent_lines(X1,X3)
    | ~ unorthogonal_lines(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7r19rrd_/input.p',i_0_37) ).

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-7r19rrd_/input.p',i_0_16) ).

cnf(i_0_9,plain,
    ~ convergent_lines(X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7r19rrd_/input.p',i_0_9) ).

cnf(i_0_28,plain,
    ( convergent_lines(X1,X2)
    | unorthogonal_lines(X1,X3)
    | ~ convergent_lines(X3,X2)
    | ~ unorthogonal_lines(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7r19rrd_/input.p',i_0_28) ).

cnf(c_0_52,plain,
    ~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
    i_0_42 ).

cnf(c_0_53,plain,
    ( convergent_lines(X1,X2)
    | unorthogonal_lines(X1,X2) ),
    i_0_24 ).

cnf(c_0_54,plain,
    ( unorthogonal_lines(X1,X2)
    | unorthogonal_lines(X1,X3)
    | ~ convergent_lines(X3,X2) ),
    i_0_31 ).

cnf(c_0_55,plain,
    convergent_lines(orthogonal_through_point(X1,X2),X1),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_56,plain,
    ( unorthogonal_lines(X1,orthogonal_through_point(X2,X3))
    | unorthogonal_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_57,negated_conjecture,
    ~ parallel_lines(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0)),
    i_0_26 ).

cnf(c_0_58,plain,
    ( parallel_lines(X1,X2)
    | convergent_lines(X1,X2) ),
    i_0_1 ).

cnf(c_0_59,plain,
    ( unorthogonal_lines(X1,X2)
    | unorthogonal_lines(X3,X2)
    | ~ convergent_lines(X1,X3)
    | ~ unorthogonal_lines(X1,X3) ),
    i_0_37 ).

cnf(c_0_60,plain,
    unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(X1,X2),X3),X1),
    inference(spm,[status(thm)],[c_0_52,c_0_56]) ).

cnf(c_0_61,plain,
    ( convergent_lines(X1,X2)
    | convergent_lines(X3,X2)
    | ~ convergent_lines(X3,X1) ),
    i_0_16 ).

cnf(c_0_62,negated_conjecture,
    convergent_lines(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0)),
    inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_63,plain,
    ( unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(X1,X2),X3),X4)
    | unorthogonal_lines(X1,X4)
    | ~ convergent_lines(orthogonal_through_point(orthogonal_through_point(X1,X2),X3),X1) ),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_64,plain,
    ( convergent_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)
    | convergent_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_65,plain,
    ~ convergent_lines(X1,X1),
    i_0_9 ).

cnf(c_0_66,plain,
    ( unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)
    | unorthogonal_lines(esk2_0,X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]) ).

cnf(c_0_67,plain,
    ( convergent_lines(orthogonal_through_point(X1,X2),X3)
    | convergent_lines(X1,X3) ),
    inference(spm,[status(thm)],[c_0_61,c_0_55]) ).

cnf(c_0_68,plain,
    ( convergent_lines(X1,X2)
    | unorthogonal_lines(X1,X3)
    | ~ convergent_lines(X3,X2)
    | ~ unorthogonal_lines(X3,X2) ),
    i_0_28 ).

cnf(c_0_69,plain,
    unorthogonal_lines(esk2_0,orthogonal_through_point(esk2_0,esk1_0)),
    inference(spm,[status(thm)],[c_0_52,c_0_66]) ).

cnf(c_0_70,plain,
    convergent_lines(X1,orthogonal_through_point(X1,X2)),
    inference(spm,[status(thm)],[c_0_65,c_0_67]) ).

cnf(c_0_71,plain,
    ( unorthogonal_lines(X1,esk2_0)
    | convergent_lines(X1,orthogonal_through_point(esk2_0,esk1_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]) ).

cnf(c_0_72,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_71]),c_0_52]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO222+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n016.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 11:16:39 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.45  # Parsing /export/starexec/sandbox2/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
% 8.40/2.49  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.40/2.49  # Version: 2.1pre011
% 8.40/2.49  # Preprocessing time       : 0.012 s
% 8.40/2.49  
% 8.40/2.49  # Proof found!
% 8.40/2.49  # SZS status Theorem
% 8.40/2.49  # SZS output start CNFRefutation
% See solution above
% 8.40/2.49  # Proof object total steps             : 30
% 8.40/2.49  # Proof object clause steps            : 21
% 8.40/2.49  # Proof object formula steps           : 9
% 8.40/2.49  # Proof object conjectures             : 3
% 8.40/2.49  # Proof object clause conjectures      : 2
% 8.40/2.49  # Proof object formula conjectures     : 1
% 8.40/2.49  # Proof object initial clauses used    : 9
% 8.40/2.49  # Proof object initial formulas used   : 9
% 8.40/2.49  # Proof object generating inferences   : 12
% 8.40/2.49  # Proof object simplifying inferences  : 4
% 8.40/2.49  # Training examples: 0 positive, 0 negative
% 8.40/2.49  # Parsed axioms                        : 47
% 8.40/2.49  # Removed by relevancy pruning/SinE    : 0
% 8.40/2.49  # Initial clauses                      : 47
% 8.40/2.49  # Removed in clause preprocessing      : 0
% 8.40/2.49  # Initial clauses in saturation        : 47
% 8.40/2.49  # Processed clauses                    : 150
% 8.40/2.49  # ...of these trivial                  : 1
% 8.40/2.49  # ...subsumed                          : 30
% 8.40/2.49  # ...remaining for further processing  : 119
% 8.40/2.49  # Other redundant clauses eliminated   : 0
% 8.40/2.49  # Clauses deleted for lack of memory   : 0
% 8.40/2.49  # Backward-subsumed                    : 2
% 8.40/2.49  # Backward-rewritten                   : 1
% 8.40/2.49  # Generated clauses                    : 815
% 8.40/2.49  # ...of the previous two non-trivial   : 710
% 8.40/2.49  # Contextual simplify-reflections      : 12
% 8.40/2.49  # Paramodulations                      : 799
% 8.40/2.49  # Factorizations                       : 16
% 8.40/2.49  # Equation resolutions                 : 0
% 8.40/2.49  # Propositional unsat checks           : 0
% 8.40/2.49  # Propositional unsat check successes  : 0
% 8.40/2.49  # Current number of processed clauses  : 116
% 8.40/2.49  #    Positive orientable unit clauses  : 18
% 8.40/2.49  #    Positive unorientable unit clauses: 0
% 8.40/2.49  #    Negative unit clauses             : 8
% 8.40/2.49  #    Non-unit-clauses                  : 90
% 8.40/2.49  # Current number of unprocessed clauses: 573
% 8.40/2.49  # ...number of literals in the above   : 2287
% 8.40/2.49  # Current number of archived formulas  : 0
% 8.40/2.49  # Current number of archived clauses   : 3
% 8.40/2.49  # Clause-clause subsumption calls (NU) : 2136
% 8.40/2.49  # Rec. Clause-clause subsumption calls : 1070
% 8.40/2.49  # Non-unit clause-clause subsumptions  : 40
% 8.40/2.49  # Unit Clause-clause subsumption calls : 482
% 8.40/2.49  # Rewrite failures with RHS unbound    : 0
% 8.40/2.49  # BW rewrite match attempts            : 11
% 8.40/2.49  # BW rewrite match successes           : 1
% 8.40/2.49  # Condensation attempts                : 0
% 8.40/2.49  # Condensation successes               : 0
% 8.40/2.49  # Termbank termtop insertions          : 13673
% 8.40/2.49  
% 8.40/2.49  # -------------------------------------------------
% 8.40/2.49  # User time                : 0.017 s
% 8.40/2.49  # System time              : 0.006 s
% 8.40/2.49  # Total time               : 0.023 s
% 8.40/2.49  # ...preprocessing         : 0.012 s
% 8.40/2.49  # ...main loop             : 0.011 s
% 8.40/2.49  # Maximum resident set size: 7124 pages
% 8.40/2.49  
%------------------------------------------------------------------------------