↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n005.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:29 EDT 2022

% Result   : Theorem 7.76s 2.35s
% Output   : CNFRefutation 7.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   28 (  12 unt;  15 nHn;  13 RR)
%            Number of literals    :   55 (   0 equ;  17 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   32 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_14,negated_conjecture,
    ~ unorthogonal_lines(esk2_0,esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jej38_en/input.p',i_0_14) ).

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

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

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

cnf(i_0_16,negated_conjecture,
    unorthogonal_lines(esk1_0,esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jej38_en/input.p',i_0_16) ).

cnf(i_0_9,plain,
    ( distinct_lines(X1,X2)
    | convergent_lines(X3,X2)
    | ~ convergent_lines(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jej38_en/input.p',i_0_9) ).

cnf(i_0_15,negated_conjecture,
    ~ distinct_lines(esk1_0,esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jej38_en/input.p',i_0_15) ).

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

cnf(c_0_34,negated_conjecture,
    ~ unorthogonal_lines(esk2_0,esk3_0),
    i_0_14 ).

cnf(c_0_35,plain,
    ( convergent_lines(X1,X2)
    | unorthogonal_lines(X1,X2) ),
    i_0_25 ).

cnf(c_0_36,plain,
    ( convergent_lines(X1,X2)
    | convergent_lines(X3,X2)
    | ~ convergent_lines(X3,X1) ),
    i_0_6 ).

cnf(c_0_37,negated_conjecture,
    convergent_lines(esk2_0,esk3_0),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,plain,
    ( convergent_lines(X1,X2)
    | unorthogonal_lines(X3,X2)
    | ~ convergent_lines(X1,X3)
    | ~ unorthogonal_lines(X1,X3) ),
    i_0_23 ).

cnf(c_0_39,negated_conjecture,
    unorthogonal_lines(esk1_0,esk2_0),
    i_0_16 ).

cnf(c_0_40,plain,
    ( distinct_lines(X1,X2)
    | convergent_lines(X3,X2)
    | ~ convergent_lines(X3,X1) ),
    i_0_9 ).

cnf(c_0_41,plain,
    ( convergent_lines(esk2_0,X1)
    | convergent_lines(esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_42,negated_conjecture,
    ( convergent_lines(esk1_0,X1)
    | unorthogonal_lines(esk2_0,X1)
    | ~ convergent_lines(esk1_0,esk2_0) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_43,negated_conjecture,
    ~ distinct_lines(esk1_0,esk3_0),
    i_0_15 ).

cnf(c_0_44,plain,
    ( convergent_lines(esk2_0,X1)
    | convergent_lines(esk3_0,X2)
    | distinct_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_45,plain,
    ~ convergent_lines(X1,X1),
    i_0_3 ).

cnf(c_0_46,negated_conjecture,
    ( convergent_lines(esk1_0,esk3_0)
    | ~ convergent_lines(esk1_0,esk2_0) ),
    inference(spm,[status(thm)],[c_0_34,c_0_42]) ).

cnf(c_0_47,negated_conjecture,
    convergent_lines(esk2_0,esk1_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).

cnf(c_0_48,plain,
    ( convergent_lines(esk1_0,X1)
    | convergent_lines(esk3_0,X1)
    | ~ convergent_lines(esk1_0,esk2_0) ),
    inference(spm,[status(thm)],[c_0_36,c_0_46]) ).

cnf(c_0_49,plain,
    ( convergent_lines(esk2_0,X1)
    | convergent_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_36,c_0_47]) ).

cnf(c_0_50,plain,
    ( convergent_lines(esk3_0,X1)
    | convergent_lines(esk1_0,X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_45]) ).

cnf(c_0_51,plain,
    convergent_lines(esk3_0,esk1_0),
    inference(spm,[status(thm)],[c_0_45,c_0_50]) ).

cnf(c_0_52,plain,
    ( convergent_lines(esk3_0,X1)
    | distinct_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_40,c_0_51]) ).

cnf(c_0_53,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_52]),c_0_45]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GEO213+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n005.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 : Sat Jun 18 00:18:10 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.76/2.35  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.76/2.35  # Version: 2.1pre011
% 7.76/2.35  # Preprocessing time       : 0.015 s
% 7.76/2.35  
% 7.76/2.35  # Proof found!
% 7.76/2.35  # SZS status Theorem
% 7.76/2.35  # SZS output start CNFRefutation
% See solution above
% 7.76/2.35  # Proof object total steps             : 28
% 7.76/2.35  # Proof object clause steps            : 20
% 7.76/2.35  # Proof object formula steps           : 8
% 7.76/2.35  # Proof object conjectures             : 11
% 7.76/2.35  # Proof object clause conjectures      : 8
% 7.76/2.35  # Proof object formula conjectures     : 3
% 7.76/2.35  # Proof object initial clauses used    : 8
% 7.76/2.35  # Proof object initial formulas used   : 8
% 7.76/2.35  # Proof object generating inferences   : 12
% 7.76/2.35  # Proof object simplifying inferences  : 3
% 7.76/2.35  # Training examples: 0 positive, 0 negative
% 7.76/2.35  # Parsed axioms                        : 28
% 7.76/2.35  # Removed by relevancy pruning/SinE    : 0
% 7.76/2.35  # Initial clauses                      : 28
% 7.76/2.35  # Removed in clause preprocessing      : 0
% 7.76/2.35  # Initial clauses in saturation        : 28
% 7.76/2.35  # Processed clauses                    : 56
% 7.76/2.35  # ...of these trivial                  : 0
% 7.76/2.35  # ...subsumed                          : 5
% 7.76/2.35  # ...remaining for further processing  : 51
% 7.76/2.35  # Other redundant clauses eliminated   : 0
% 7.76/2.35  # Clauses deleted for lack of memory   : 0
% 7.76/2.35  # Backward-subsumed                    : 2
% 7.76/2.35  # Backward-rewritten                   : 0
% 7.76/2.35  # Generated clauses                    : 97
% 7.76/2.35  # ...of the previous two non-trivial   : 81
% 7.76/2.35  # Contextual simplify-reflections      : 8
% 7.76/2.35  # Paramodulations                      : 93
% 7.76/2.35  # Factorizations                       : 4
% 7.76/2.35  # Equation resolutions                 : 0
% 7.76/2.35  # Propositional unsat checks           : 0
% 7.76/2.35  # Propositional unsat check successes  : 0
% 7.76/2.35  # Current number of processed clauses  : 49
% 7.76/2.35  #    Positive orientable unit clauses  : 5
% 7.76/2.35  #    Positive unorientable unit clauses: 0
% 7.76/2.35  #    Negative unit clauses             : 9
% 7.76/2.35  #    Non-unit-clauses                  : 35
% 7.76/2.35  # Current number of unprocessed clauses: 49
% 7.76/2.35  # ...number of literals in the above   : 191
% 7.76/2.35  # Current number of archived formulas  : 0
% 7.76/2.35  # Current number of archived clauses   : 2
% 7.76/2.35  # Clause-clause subsumption calls (NU) : 224
% 7.76/2.35  # Rec. Clause-clause subsumption calls : 152
% 7.76/2.35  # Non-unit clause-clause subsumptions  : 15
% 7.76/2.35  # Unit Clause-clause subsumption calls : 46
% 7.76/2.35  # Rewrite failures with RHS unbound    : 0
% 7.76/2.35  # BW rewrite match attempts            : 0
% 7.76/2.35  # BW rewrite match successes           : 0
% 7.76/2.35  # Condensation attempts                : 0
% 7.76/2.35  # Condensation successes               : 0
% 7.76/2.35  # Termbank termtop insertions          : 1648
% 7.76/2.35  
% 7.76/2.35  # -------------------------------------------------
% 7.76/2.35  # User time                : 0.017 s
% 7.76/2.35  # System time              : 0.000 s
% 7.76/2.35  # Total time               : 0.017 s
% 7.76/2.35  # ...preprocessing         : 0.015 s
% 7.76/2.35  # ...main loop             : 0.003 s
% 7.76/2.35  # Maximum resident set size: 7136 pages
% 7.76/2.35  
%------------------------------------------------------------------------------