↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n024.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:43:53 EDT 2022

% Result   : Theorem 4.51s 2.22s
% Output   : CNFRefutation 4.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (   8 unt;   6 nHn;   8 RR)
%            Number of literals    :   24 (   0 equ;   8 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   16 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
    ( convergent_lines(X1,X2)
    | convergent_lines(X3,X2)
    | ~ convergent_lines(X3,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uh8pgq17/input.p',i_0_6) ).

cnf(i_0_15,negated_conjecture,
    convergent_lines(esk1_0,esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uh8pgq17/input.p',i_0_15) ).

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

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

cnf(i_0_14,negated_conjecture,
    ~ distinct_lines(esk1_0,esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uh8pgq17/input.p',i_0_14) ).

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

cnf(c_0_22,negated_conjecture,
    convergent_lines(esk1_0,esk2_0),
    i_0_15 ).

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

cnf(c_0_24,negated_conjecture,
    ( convergent_lines(esk1_0,X1)
    | convergent_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

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

cnf(c_0_26,plain,
    convergent_lines(esk2_0,esk1_0),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,negated_conjecture,
    ~ distinct_lines(esk1_0,esk2_0),
    i_0_14 ).

cnf(c_0_28,plain,
    ( distinct_lines(esk1_0,X1)
    | convergent_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_29,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GEO171+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n024.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 02:10:19 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.44  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.44  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.44  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 4.51/2.22  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 4.51/2.22  # Version: 2.1pre011
% 4.51/2.22  # Preprocessing time       : 0.016 s
% 4.51/2.22  
% 4.51/2.22  # Proof found!
% 4.51/2.22  # SZS status Theorem
% 4.51/2.22  # SZS output start CNFRefutation
% See solution above
% 4.51/2.22  # Proof object total steps             : 14
% 4.51/2.22  # Proof object clause steps            : 9
% 4.51/2.22  # Proof object formula steps           : 5
% 4.51/2.22  # Proof object conjectures             : 6
% 4.51/2.22  # Proof object clause conjectures      : 4
% 4.51/2.23  # Proof object formula conjectures     : 2
% 4.51/2.23  # Proof object initial clauses used    : 5
% 4.51/2.23  # Proof object initial formulas used   : 5
% 4.51/2.23  # Proof object generating inferences   : 4
% 4.51/2.23  # Proof object simplifying inferences  : 1
% 4.51/2.23  # Training examples: 0 positive, 0 negative
% 4.51/2.23  # Parsed axioms                        : 16
% 4.51/2.23  # Removed by relevancy pruning/SinE    : 0
% 4.51/2.23  # Initial clauses                      : 16
% 4.51/2.23  # Removed in clause preprocessing      : 0
% 4.51/2.23  # Initial clauses in saturation        : 16
% 4.51/2.23  # Processed clauses                    : 21
% 4.51/2.23  # ...of these trivial                  : 0
% 4.51/2.23  # ...subsumed                          : 1
% 4.51/2.23  # ...remaining for further processing  : 20
% 4.51/2.23  # Other redundant clauses eliminated   : 0
% 4.51/2.23  # Clauses deleted for lack of memory   : 0
% 4.51/2.23  # Backward-subsumed                    : 0
% 4.51/2.23  # Backward-rewritten                   : 0
% 4.51/2.23  # Generated clauses                    : 12
% 4.51/2.23  # ...of the previous two non-trivial   : 9
% 4.51/2.23  # Contextual simplify-reflections      : 0
% 4.51/2.23  # Paramodulations                      : 12
% 4.51/2.23  # Factorizations                       : 0
% 4.51/2.23  # Equation resolutions                 : 0
% 4.51/2.23  # Propositional unsat checks           : 0
% 4.51/2.23  # Propositional unsat check successes  : 0
% 4.51/2.23  # Current number of processed clauses  : 20
% 4.51/2.23  #    Positive orientable unit clauses  : 2
% 4.51/2.23  #    Positive unorientable unit clauses: 0
% 4.51/2.23  #    Negative unit clauses             : 4
% 4.51/2.23  #    Non-unit-clauses                  : 14
% 4.51/2.23  # Current number of unprocessed clauses: 3
% 4.51/2.23  # ...number of literals in the above   : 9
% 4.51/2.23  # Current number of archived formulas  : 0
% 4.51/2.23  # Current number of archived clauses   : 0
% 4.51/2.23  # Clause-clause subsumption calls (NU) : 7
% 4.51/2.23  # Rec. Clause-clause subsumption calls : 7
% 4.51/2.23  # Non-unit clause-clause subsumptions  : 1
% 4.51/2.23  # Unit Clause-clause subsumption calls : 2
% 4.51/2.23  # Rewrite failures with RHS unbound    : 0
% 4.51/2.23  # BW rewrite match attempts            : 0
% 4.51/2.23  # BW rewrite match successes           : 0
% 4.51/2.23  # Condensation attempts                : 0
% 4.51/2.23  # Condensation successes               : 0
% 4.51/2.23  # Termbank termtop insertions          : 421
% 4.51/2.23  
% 4.51/2.23  # -------------------------------------------------
% 4.51/2.23  # User time                : 0.012 s
% 4.51/2.23  # System time              : 0.005 s
% 4.51/2.23  # Total time               : 0.017 s
% 4.51/2.23  # ...preprocessing         : 0.016 s
% 4.51/2.23  # ...main loop             : 0.001 s
% 4.51/2.23  # Maximum resident set size: 7128 pages
% 4.51/2.23  
%------------------------------------------------------------------------------