↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : GEO234+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n020.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:44 EDT 2022

% Result   : Theorem 7.78s 2.45s
% Output   : CNFRefutation 7.78s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   34 (  16 unt;  11 nHn;  23 RR)
%            Number of literals    :   60 (   0 equ;  25 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   42 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_67,negated_conjecture,
    ~ unequally_directed_opposite_lines(esk2_0,esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4gfv1lkh/input.p',i_0_67) ).

cnf(i_0_1,plain,
    ( unequally_directed_opposite_lines(X1,X2)
    | ~ unequally_directed_lines(X1,reverse_line(X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4gfv1lkh/input.p',i_0_1) ).

cnf(i_0_63,plain,
    ( unequally_directed_lines(X1,X2)
    | unequally_directed_lines(X1,reverse_line(X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4gfv1lkh/input.p',i_0_63) ).

cnf(i_0_55,plain,
    ( unequally_directed_lines(X1,X2)
    | unequally_directed_lines(X3,X2)
    | ~ unequally_directed_lines(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4gfv1lkh/input.p',i_0_55) ).

cnf(i_0_8,plain,
    ( ~ unequally_directed_lines(X1,X2)
    | ~ equally_directed_lines(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4gfv1lkh/input.p',i_0_8) ).

cnf(i_0_52,plain,
    equally_directed_lines(X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4gfv1lkh/input.p',i_0_52) ).

cnf(i_0_65,plain,
    ( left_convergent_lines(X1,X2)
    | left_convergent_lines(X1,reverse_line(X2))
    | ~ unequally_directed_lines(X1,X2)
    | ~ unequally_directed_lines(X1,reverse_line(X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4gfv1lkh/input.p',i_0_65) ).

cnf(i_0_33,plain,
    ~ left_convergent_lines(X1,X2),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4gfv1lkh/input.p',i_0_33) ).

cnf(i_0_2,plain,
    ( unequally_directed_lines(X1,reverse_line(X2))
    | ~ unequally_directed_opposite_lines(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4gfv1lkh/input.p',i_0_2) ).

cnf(i_0_69,negated_conjecture,
    unequally_directed_opposite_lines(esk1_0,esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4gfv1lkh/input.p',i_0_69) ).

cnf(i_0_68,negated_conjecture,
    ~ unequally_directed_lines(esk1_0,esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4gfv1lkh/input.p',i_0_68) ).

cnf(c_0_81,negated_conjecture,
    ~ unequally_directed_opposite_lines(esk2_0,esk3_0),
    i_0_67 ).

cnf(c_0_82,plain,
    ( unequally_directed_opposite_lines(X1,X2)
    | ~ unequally_directed_lines(X1,reverse_line(X2)) ),
    i_0_1 ).

cnf(c_0_83,negated_conjecture,
    ~ unequally_directed_lines(esk2_0,reverse_line(esk3_0)),
    inference(spm,[status(thm)],[c_0_81,c_0_82]) ).

cnf(c_0_84,plain,
    ( unequally_directed_lines(X1,X2)
    | unequally_directed_lines(X1,reverse_line(X2)) ),
    i_0_63 ).

cnf(c_0_85,plain,
    ( unequally_directed_lines(X1,X2)
    | unequally_directed_lines(X3,X2)
    | ~ unequally_directed_lines(X3,X1) ),
    i_0_55 ).

cnf(c_0_86,plain,
    unequally_directed_lines(esk2_0,esk3_0),
    inference(spm,[status(thm)],[c_0_83,c_0_84]) ).

cnf(c_0_87,plain,
    ( ~ unequally_directed_lines(X1,X2)
    | ~ equally_directed_lines(X1,X2) ),
    i_0_8 ).

cnf(c_0_88,plain,
    equally_directed_lines(X1,X1),
    i_0_52 ).

cnf(c_0_89,plain,
    ( unequally_directed_lines(esk2_0,X1)
    | unequally_directed_lines(esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_85,c_0_86]) ).

cnf(c_0_90,plain,
    ~ unequally_directed_lines(X1,X1),
    inference(spm,[status(thm)],[c_0_87,c_0_88]) ).

cnf(c_0_91,plain,
    ( unequally_directed_lines(esk2_0,X1)
    | unequally_directed_lines(esk3_0,X2)
    | unequally_directed_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_85,c_0_89]) ).

cnf(c_0_92,plain,
    ( unequally_directed_lines(X1,esk3_0)
    | unequally_directed_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_90,c_0_91]) ).

cnf(c_0_93,plain,
    ( left_convergent_lines(X1,X2)
    | left_convergent_lines(X1,reverse_line(X2))
    | ~ unequally_directed_lines(X1,X2)
    | ~ unequally_directed_lines(X1,reverse_line(X2)) ),
    i_0_65 ).

cnf(c_0_94,plain,
    ~ left_convergent_lines(X1,X2),
    i_0_33 ).

cnf(c_0_95,plain,
    ( unequally_directed_lines(X1,reverse_line(X2))
    | ~ unequally_directed_opposite_lines(X1,X2) ),
    i_0_2 ).

cnf(c_0_96,negated_conjecture,
    unequally_directed_opposite_lines(esk1_0,esk2_0),
    i_0_69 ).

cnf(c_0_97,plain,
    ( unequally_directed_lines(X1,esk3_0)
    | unequally_directed_lines(esk2_0,X2)
    | unequally_directed_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_85,c_0_92]) ).

cnf(c_0_98,plain,
    ( ~ unequally_directed_lines(X1,reverse_line(X2))
    | ~ unequally_directed_lines(X1,X2) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_93,c_0_94]),c_0_94]) ).

cnf(c_0_99,negated_conjecture,
    unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
    inference(spm,[status(thm)],[c_0_95,c_0_96]) ).

cnf(c_0_100,negated_conjecture,
    ~ unequally_directed_lines(esk1_0,esk3_0),
    i_0_68 ).

cnf(c_0_101,plain,
    ( unequally_directed_lines(X1,esk2_0)
    | unequally_directed_lines(X1,esk3_0) ),
    inference(spm,[status(thm)],[c_0_90,c_0_97]) ).

cnf(c_0_102,plain,
    ~ unequally_directed_lines(esk1_0,esk2_0),
    inference(spm,[status(thm)],[c_0_98,c_0_99]) ).

cnf(c_0_103,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GEO234+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n020.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Fri Jun 17 21:18:06 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.45  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.78/2.45  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.78/2.45  # Version: 2.1pre011
% 7.78/2.45  # Preprocessing time       : 0.015 s
% 7.78/2.45  
% 7.78/2.45  # Proof found!
% 7.78/2.45  # SZS status Theorem
% 7.78/2.45  # SZS output start CNFRefutation
% See solution above
% 7.78/2.45  # Proof object total steps             : 34
% 7.78/2.45  # Proof object clause steps            : 23
% 7.78/2.45  # Proof object formula steps           : 11
% 7.78/2.45  # Proof object conjectures             : 9
% 7.78/2.45  # Proof object clause conjectures      : 6
% 7.78/2.45  # Proof object formula conjectures     : 3
% 7.78/2.45  # Proof object initial clauses used    : 11
% 7.78/2.45  # Proof object initial formulas used   : 11
% 7.78/2.45  # Proof object generating inferences   : 11
% 7.78/2.45  # Proof object simplifying inferences  : 3
% 7.78/2.45  # Training examples: 0 positive, 0 negative
% 7.78/2.45  # Parsed axioms                        : 69
% 7.78/2.45  # Removed by relevancy pruning/SinE    : 0
% 7.78/2.45  # Initial clauses                      : 69
% 7.78/2.45  # Removed in clause preprocessing      : 0
% 7.78/2.45  # Initial clauses in saturation        : 69
% 7.78/2.45  # Processed clauses                    : 94
% 7.78/2.45  # ...of these trivial                  : 1
% 7.78/2.45  # ...subsumed                          : 24
% 7.78/2.45  # ...remaining for further processing  : 69
% 7.78/2.45  # Other redundant clauses eliminated   : 0
% 7.78/2.45  # Clauses deleted for lack of memory   : 0
% 7.78/2.45  # Backward-subsumed                    : 2
% 7.78/2.45  # Backward-rewritten                   : 0
% 7.78/2.45  # Generated clauses                    : 119
% 7.78/2.45  # ...of the previous two non-trivial   : 90
% 7.78/2.45  # Contextual simplify-reflections      : 7
% 7.78/2.45  # Paramodulations                      : 105
% 7.78/2.45  # Factorizations                       : 14
% 7.78/2.45  # Equation resolutions                 : 0
% 7.78/2.45  # Propositional unsat checks           : 0
% 7.78/2.45  # Propositional unsat check successes  : 0
% 7.78/2.45  # Current number of processed clauses  : 67
% 7.78/2.45  #    Positive orientable unit clauses  : 7
% 7.78/2.45  #    Positive unorientable unit clauses: 0
% 7.78/2.45  #    Negative unit clauses             : 17
% 7.78/2.45  #    Non-unit-clauses                  : 43
% 7.78/2.45  # Current number of unprocessed clauses: 62
% 7.78/2.45  # ...number of literals in the above   : 159
% 7.78/2.45  # Current number of archived formulas  : 0
% 7.78/2.45  # Current number of archived clauses   : 2
% 7.78/2.45  # Clause-clause subsumption calls (NU) : 729
% 7.78/2.45  # Rec. Clause-clause subsumption calls : 505
% 7.78/2.45  # Non-unit clause-clause subsumptions  : 14
% 7.78/2.45  # Unit Clause-clause subsumption calls : 163
% 7.78/2.45  # Rewrite failures with RHS unbound    : 0
% 7.78/2.45  # BW rewrite match attempts            : 1
% 7.78/2.45  # BW rewrite match successes           : 0
% 7.78/2.45  # Condensation attempts                : 0
% 7.78/2.45  # Condensation successes               : 0
% 7.78/2.45  # Termbank termtop insertions          : 2294
% 7.78/2.45  
% 7.78/2.45  # -------------------------------------------------
% 7.78/2.45  # User time                : 0.014 s
% 7.78/2.45  # System time              : 0.004 s
% 7.78/2.45  # Total time               : 0.018 s
% 7.78/2.45  # ...preprocessing         : 0.015 s
% 7.78/2.45  # ...main loop             : 0.003 s
% 7.78/2.45  # Maximum resident set size: 7136 pages
% 7.78/2.45  
%------------------------------------------------------------------------------