↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n032.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.38s 2.30s
% Output   : CNFRefutation 7.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   31 (  13 unt;  14 nHn;  20 RR)
%            Number of literals    :   58 (   0 equ;  21 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   34 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_38,plain,
    ( unequally_directed_lines(X1,X2)
    | unequally_directed_lines(X3,X2)
    | ~ unequally_directed_lines(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qwitm_b4/input.p',i_0_38) ).

cnf(i_0_19,negated_conjecture,
    unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qwitm_b4/input.p',i_0_19) ).

cnf(i_0_44,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-qwitm_b4/input.p',i_0_44) ).

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

cnf(i_0_37,plain,
    ~ unequally_directed_lines(X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qwitm_b4/input.p',i_0_37) ).

cnf(i_0_17,negated_conjecture,
    ~ unequally_directed_lines(esk2_0,reverse_line(esk3_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qwitm_b4/input.p',i_0_17) ).

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

cnf(c_0_52,plain,
    ( unequally_directed_lines(X1,X2)
    | unequally_directed_lines(X3,X2)
    | ~ unequally_directed_lines(X3,X1) ),
    i_0_38 ).

cnf(c_0_53,negated_conjecture,
    unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
    i_0_19 ).

cnf(c_0_54,negated_conjecture,
    ( unequally_directed_lines(reverse_line(esk2_0),X1)
    | unequally_directed_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_55,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_44 ).

cnf(c_0_56,plain,
    ~ left_convergent_lines(X1,X2),
    i_0_32 ).

cnf(c_0_57,plain,
    ~ unequally_directed_lines(X1,X1),
    i_0_37 ).

cnf(c_0_58,plain,
    ( unequally_directed_lines(reverse_line(esk2_0),X1)
    | unequally_directed_lines(esk1_0,X2)
    | unequally_directed_lines(X2,X1) ),
    inference(spm,[status(thm)],[c_0_52,c_0_54]) ).

cnf(c_0_59,plain,
    ( ~ unequally_directed_lines(X1,reverse_line(X2))
    | ~ unequally_directed_lines(X1,X2) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_55,c_0_56]),c_0_56]) ).

cnf(c_0_60,plain,
    ( unequally_directed_lines(X1,reverse_line(esk2_0))
    | unequally_directed_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_61,plain,
    ( unequally_directed_lines(esk1_0,reverse_line(X1))
    | ~ unequally_directed_lines(reverse_line(esk2_0),X1) ),
    inference(spm,[status(thm)],[c_0_59,c_0_54]) ).

cnf(c_0_62,plain,
    ( unequally_directed_lines(esk1_0,X1)
    | ~ unequally_directed_lines(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_63,negated_conjecture,
    ( unequally_directed_lines(esk1_0,reverse_line(X1))
    | unequally_directed_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_61,c_0_54]) ).

cnf(c_0_64,plain,
    ( unequally_directed_lines(reverse_line(esk2_0),esk2_0)
    | unequally_directed_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_62,c_0_58]) ).

cnf(c_0_65,plain,
    ( unequally_directed_lines(reverse_line(X1),X2)
    | unequally_directed_lines(esk1_0,X1)
    | unequally_directed_lines(esk1_0,X2) ),
    inference(spm,[status(thm)],[c_0_52,c_0_63]) ).

cnf(c_0_66,plain,
    unequally_directed_lines(reverse_line(esk2_0),esk2_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_64]),c_0_64]) ).

cnf(c_0_67,plain,
    ( unequally_directed_lines(esk1_0,reverse_line(X1))
    | unequally_directed_lines(esk1_0,X2)
    | ~ unequally_directed_lines(reverse_line(X2),X1) ),
    inference(spm,[status(thm)],[c_0_59,c_0_65]) ).

cnf(c_0_68,plain,
    ( unequally_directed_lines(reverse_line(esk2_0),X1)
    | unequally_directed_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_52,c_0_66]) ).

cnf(c_0_69,negated_conjecture,
    ~ unequally_directed_lines(esk1_0,esk2_0),
    inference(spm,[status(thm)],[c_0_59,c_0_53]) ).

cnf(c_0_70,plain,
    ( unequally_directed_lines(esk1_0,reverse_line(X1))
    | unequally_directed_lines(esk2_0,X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]) ).

cnf(c_0_71,plain,
    ( unequally_directed_lines(esk2_0,X1)
    | ~ unequally_directed_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_59,c_0_70]) ).

cnf(c_0_72,negated_conjecture,
    ~ unequally_directed_lines(esk2_0,reverse_line(esk3_0)),
    i_0_17 ).

cnf(c_0_73,negated_conjecture,
    ( unequally_directed_lines(esk2_0,reverse_line(X1))
    | unequally_directed_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_71,c_0_63]) ).

cnf(c_0_74,negated_conjecture,
    ~ unequally_directed_lines(esk1_0,esk3_0),
    i_0_18 ).

cnf(c_0_75,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem  : GEO234+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.03/0.10  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.29  % Computer : n032.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 600
% 0.09/0.29  % DateTime : Sat Jun 18 06:10:33 EDT 2022
% 0.09/0.29  % CPUTime  : 
% 0.14/0.38  # ENIGMATIC: Selected SinE mode:
% 0.14/0.38  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.14/0.38  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.14/0.38  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.38/2.30  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.38/2.30  # Version: 2.1pre011
% 7.38/2.30  # Preprocessing time       : 0.010 s
% 7.38/2.30  
% 7.38/2.30  # Proof found!
% 7.38/2.30  # SZS status Theorem
% 7.38/2.30  # SZS output start CNFRefutation
% See solution above
% 7.38/2.30  # Proof object total steps             : 31
% 7.38/2.30  # Proof object clause steps            : 24
% 7.38/2.30  # Proof object formula steps           : 7
% 7.38/2.30  # Proof object conjectures             : 11
% 7.38/2.30  # Proof object clause conjectures      : 8
% 7.38/2.30  # Proof object formula conjectures     : 3
% 7.38/2.30  # Proof object initial clauses used    : 7
% 7.38/2.30  # Proof object initial formulas used   : 7
% 7.38/2.30  # Proof object generating inferences   : 16
% 7.38/2.30  # Proof object simplifying inferences  : 5
% 7.38/2.30  # Training examples: 0 positive, 0 negative
% 7.38/2.30  # Parsed axioms                        : 61
% 7.38/2.30  # Removed by relevancy pruning/SinE    : 0
% 7.38/2.30  # Initial clauses                      : 61
% 7.38/2.30  # Removed in clause preprocessing      : 0
% 7.38/2.30  # Initial clauses in saturation        : 61
% 7.38/2.30  # Processed clauses                    : 121
% 7.38/2.30  # ...of these trivial                  : 3
% 7.38/2.30  # ...subsumed                          : 38
% 7.38/2.30  # ...remaining for further processing  : 80
% 7.38/2.30  # Other redundant clauses eliminated   : 0
% 7.38/2.30  # Clauses deleted for lack of memory   : 0
% 7.38/2.30  # Backward-subsumed                    : 5
% 7.38/2.30  # Backward-rewritten                   : 0
% 7.38/2.30  # Generated clauses                    : 327
% 7.38/2.30  # ...of the previous two non-trivial   : 273
% 7.38/2.30  # Contextual simplify-reflections      : 15
% 7.38/2.30  # Paramodulations                      : 289
% 7.38/2.30  # Factorizations                       : 38
% 7.38/2.30  # Equation resolutions                 : 0
% 7.38/2.30  # Propositional unsat checks           : 0
% 7.38/2.30  # Propositional unsat check successes  : 0
% 7.38/2.30  # Current number of processed clauses  : 75
% 7.38/2.30  #    Positive orientable unit clauses  : 8
% 7.38/2.30  #    Positive unorientable unit clauses: 0
% 7.38/2.30  #    Negative unit clauses             : 15
% 7.38/2.30  #    Non-unit-clauses                  : 52
% 7.38/2.30  # Current number of unprocessed clauses: 201
% 7.38/2.30  # ...number of literals in the above   : 773
% 7.38/2.30  # Current number of archived formulas  : 0
% 7.38/2.30  # Current number of archived clauses   : 5
% 7.38/2.30  # Clause-clause subsumption calls (NU) : 1081
% 7.38/2.30  # Rec. Clause-clause subsumption calls : 535
% 7.38/2.30  # Non-unit clause-clause subsumptions  : 37
% 7.38/2.30  # Unit Clause-clause subsumption calls : 200
% 7.38/2.30  # Rewrite failures with RHS unbound    : 0
% 7.38/2.30  # BW rewrite match attempts            : 2
% 7.38/2.30  # BW rewrite match successes           : 2
% 7.38/2.30  # Condensation attempts                : 0
% 7.38/2.30  # Condensation successes               : 0
% 7.38/2.30  # Termbank termtop insertions          : 4478
% 7.38/2.30  
% 7.38/2.30  # -------------------------------------------------
% 7.38/2.30  # User time                : 0.010 s
% 7.38/2.30  # System time              : 0.005 s
% 7.38/2.30  # Total time               : 0.015 s
% 7.38/2.30  # ...preprocessing         : 0.010 s
% 7.38/2.30  # ...main loop             : 0.005 s
% 7.38/2.30  # Maximum resident set size: 7128 pages
% 7.38/2.30  
%------------------------------------------------------------------------------