↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n017.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:13 EDT 2022

% Result   : Theorem 8.32s 2.48s
% Output   : CNFRefutation 8.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   41 (  16 unt;  17 nHn;  37 RR)
%            Number of literals    :  107 (   0 equ;  37 neg)
%            Maximal clause size   :    7 (   2 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-2 aty)
%            Number of variables   :   57 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_19,plain,
    ( apart_point_and_line(X1,X2)
    | apart_point_and_line(X1,X3)
    | apart_point_and_line(X4,X2)
    | apart_point_and_line(X4,X3)
    | ~ distinct_points(X4,X1)
    | ~ distinct_lines(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs077ov3/input.p',i_0_19) ).

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

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-vs077ov3/input.p',i_0_6) ).

cnf(i_0_18,negated_conjecture,
    convergent_lines(esk1_0,esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs077ov3/input.p',i_0_18) ).

cnf(i_0_12,plain,
    ( distinct_points(X1,intersection_point(X2,X3))
    | ~ convergent_lines(X2,X3)
    | ~ apart_point_and_line(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs077ov3/input.p',i_0_12) ).

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

cnf(i_0_17,negated_conjecture,
    convergent_lines(esk3_0,esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs077ov3/input.p',i_0_17) ).

cnf(i_0_15,negated_conjecture,
    apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs077ov3/input.p',i_0_15) ).

cnf(i_0_1,plain,
    ~ distinct_points(X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs077ov3/input.p',i_0_1) ).

cnf(i_0_13,plain,
    ( distinct_points(X1,intersection_point(X2,X3))
    | ~ convergent_lines(X2,X3)
    | ~ apart_point_and_line(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs077ov3/input.p',i_0_13) ).

cnf(i_0_14,negated_conjecture,
    ~ apart_point_and_line(intersection_point(esk2_0,esk1_0),esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vs077ov3/input.p',i_0_14) ).

cnf(c_0_31,plain,
    ( apart_point_and_line(X1,X2)
    | apart_point_and_line(X1,X3)
    | apart_point_and_line(X4,X2)
    | apart_point_and_line(X4,X3)
    | ~ distinct_points(X4,X1)
    | ~ distinct_lines(X3,X2) ),
    i_0_19 ).

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

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

cnf(c_0_34,negated_conjecture,
    convergent_lines(esk1_0,esk2_0),
    i_0_18 ).

cnf(c_0_35,plain,
    ( apart_point_and_line(X1,X2)
    | apart_point_and_line(X1,X3)
    | apart_point_and_line(X4,X2)
    | apart_point_and_line(X4,X3)
    | ~ distinct_points(X1,X4)
    | ~ convergent_lines(X2,X3) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,plain,
    ( distinct_points(X1,intersection_point(X2,X3))
    | ~ convergent_lines(X2,X3)
    | ~ apart_point_and_line(X1,X3) ),
    i_0_12 ).

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

cnf(c_0_38,negated_conjecture,
    ( convergent_lines(esk1_0,X1)
    | convergent_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_39,plain,
    ( apart_point_and_line(intersection_point(X1,X2),X3)
    | apart_point_and_line(intersection_point(X1,X2),X4)
    | apart_point_and_line(X5,X3)
    | apart_point_and_line(X5,X4)
    | ~ apart_point_and_line(X5,X2)
    | ~ convergent_lines(X4,X3)
    | ~ convergent_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_40,plain,
    convergent_lines(esk2_0,esk1_0),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_41,negated_conjecture,
    convergent_lines(esk3_0,esk2_0),
    i_0_17 ).

cnf(c_0_42,plain,
    ( apart_point_and_line(intersection_point(X1,X2),esk2_0)
    | apart_point_and_line(intersection_point(X1,X2),esk1_0)
    | apart_point_and_line(X3,esk2_0)
    | apart_point_and_line(X3,esk1_0)
    | ~ apart_point_and_line(X3,X2)
    | ~ convergent_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_43,negated_conjecture,
    apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
    i_0_15 ).

cnf(c_0_44,negated_conjecture,
    ( convergent_lines(esk3_0,X1)
    | convergent_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_33,c_0_41]) ).

cnf(c_0_45,plain,
    ~ distinct_points(X1,X1),
    i_0_1 ).

cnf(c_0_46,plain,
    ( distinct_points(X1,intersection_point(X2,X3))
    | ~ convergent_lines(X2,X3)
    | ~ apart_point_and_line(X1,X2) ),
    i_0_13 ).

cnf(c_0_47,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
    | apart_point_and_line(intersection_point(X1,esk3_0),esk1_0)
    | apart_point_and_line(intersection_point(X1,esk3_0),esk2_0)
    | ~ convergent_lines(X1,esk3_0) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_48,plain,
    convergent_lines(esk2_0,esk3_0),
    inference(spm,[status(thm)],[c_0_37,c_0_44]) ).

cnf(c_0_49,plain,
    ( ~ apart_point_and_line(intersection_point(X1,X2),X1)
    | ~ convergent_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_50,plain,
    ( apart_point_and_line(intersection_point(esk2_0,esk3_0),esk2_0)
    | apart_point_and_line(intersection_point(esk2_0,esk3_0),esk1_0)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0) ),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_51,plain,
    ( ~ apart_point_and_line(intersection_point(X1,X2),X2)
    | ~ convergent_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_45,c_0_36]) ).

cnf(c_0_52,plain,
    ( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
    | apart_point_and_line(intersection_point(esk2_0,esk3_0),esk1_0)
    | apart_point_and_line(intersection_point(esk2_0,esk3_0),esk2_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_34])]) ).

cnf(c_0_53,negated_conjecture,
    ( apart_point_and_line(intersection_point(X1,X2),esk3_0)
    | apart_point_and_line(intersection_point(X1,X2),esk2_0)
    | apart_point_and_line(X3,esk3_0)
    | apart_point_and_line(X3,esk2_0)
    | ~ apart_point_and_line(X3,X2)
    | ~ convergent_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_39,c_0_41]) ).

cnf(c_0_54,plain,
    ( apart_point_and_line(intersection_point(esk2_0,esk3_0),esk2_0)
    | apart_point_and_line(intersection_point(esk2_0,esk3_0),esk1_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_34])]) ).

cnf(c_0_55,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk2_0,esk3_0),esk2_0)
    | apart_point_and_line(intersection_point(esk2_0,esk3_0),esk3_0)
    | apart_point_and_line(intersection_point(X1,esk1_0),esk2_0)
    | apart_point_and_line(intersection_point(X1,esk1_0),esk3_0)
    | ~ convergent_lines(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_56,negated_conjecture,
    ~ apart_point_and_line(intersection_point(esk2_0,esk1_0),esk3_0),
    i_0_14 ).

cnf(c_0_57,plain,
    ( apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)
    | apart_point_and_line(intersection_point(esk2_0,esk3_0),esk3_0)
    | apart_point_and_line(intersection_point(esk2_0,esk3_0),esk2_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_40]),c_0_56]) ).

cnf(c_0_58,plain,
    ( apart_point_and_line(intersection_point(esk2_0,esk3_0),esk2_0)
    | apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_57]),c_0_48])]) ).

cnf(c_0_59,plain,
    apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_58]),c_0_48])]) ).

cnf(c_0_60,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_59]),c_0_40])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO195+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n017.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Fri Jun 17 18:13:28 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.46  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.32/2.48  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.32/2.48  # Version: 2.1pre011
% 8.32/2.48  # Preprocessing time       : 0.017 s
% 8.32/2.48  
% 8.32/2.48  # Proof found!
% 8.32/2.48  # SZS status Theorem
% 8.32/2.48  # SZS output start CNFRefutation
% See solution above
% 8.32/2.48  # Proof object total steps             : 41
% 8.32/2.48  # Proof object clause steps            : 30
% 8.32/2.48  # Proof object formula steps           : 11
% 8.32/2.48  # Proof object conjectures             : 13
% 8.32/2.48  # Proof object clause conjectures      : 9
% 8.32/2.48  # Proof object formula conjectures     : 4
% 8.32/2.48  # Proof object initial clauses used    : 11
% 8.32/2.48  # Proof object initial formulas used   : 11
% 8.32/2.48  # Proof object generating inferences   : 19
% 8.32/2.48  # Proof object simplifying inferences  : 11
% 8.32/2.48  # Training examples: 0 positive, 0 negative
% 8.32/2.48  # Parsed axioms                        : 19
% 8.32/2.48  # Removed by relevancy pruning/SinE    : 0
% 8.32/2.48  # Initial clauses                      : 19
% 8.32/2.48  # Removed in clause preprocessing      : 0
% 8.32/2.48  # Initial clauses in saturation        : 19
% 8.32/2.48  # Processed clauses                    : 145
% 8.32/2.48  # ...of these trivial                  : 4
% 8.32/2.48  # ...subsumed                          : 44
% 8.32/2.48  # ...remaining for further processing  : 97
% 8.32/2.48  # Other redundant clauses eliminated   : 0
% 8.32/2.48  # Clauses deleted for lack of memory   : 0
% 8.32/2.48  # Backward-subsumed                    : 4
% 8.32/2.48  # Backward-rewritten                   : 1
% 8.32/2.48  # Generated clauses                    : 726
% 8.32/2.48  # ...of the previous two non-trivial   : 628
% 8.32/2.48  # Contextual simplify-reflections      : 4
% 8.32/2.48  # Paramodulations                      : 616
% 8.32/2.48  # Factorizations                       : 110
% 8.32/2.48  # Equation resolutions                 : 0
% 8.32/2.48  # Propositional unsat checks           : 0
% 8.32/2.48  # Propositional unsat check successes  : 0
% 8.32/2.48  # Current number of processed clauses  : 92
% 8.32/2.48  #    Positive orientable unit clauses  : 13
% 8.32/2.48  #    Positive unorientable unit clauses: 0
% 8.32/2.48  #    Negative unit clauses             : 4
% 8.32/2.48  #    Non-unit-clauses                  : 75
% 8.32/2.48  # Current number of unprocessed clauses: 469
% 8.32/2.48  # ...number of literals in the above   : 2439
% 8.32/2.48  # Current number of archived formulas  : 0
% 8.32/2.48  # Current number of archived clauses   : 5
% 8.32/2.48  # Clause-clause subsumption calls (NU) : 888
% 8.32/2.48  # Rec. Clause-clause subsumption calls : 395
% 8.32/2.48  # Non-unit clause-clause subsumptions  : 50
% 8.32/2.48  # Unit Clause-clause subsumption calls : 35
% 8.32/2.48  # Rewrite failures with RHS unbound    : 0
% 8.32/2.48  # BW rewrite match attempts            : 2
% 8.32/2.48  # BW rewrite match successes           : 2
% 8.32/2.48  # Condensation attempts                : 0
% 8.32/2.48  # Condensation successes               : 0
% 8.32/2.48  # Termbank termtop insertions          : 10262
% 8.32/2.48  
% 8.32/2.48  # -------------------------------------------------
% 8.32/2.48  # User time                : 0.026 s
% 8.32/2.48  # System time              : 0.004 s
% 8.32/2.48  # Total time               : 0.030 s
% 8.32/2.48  # ...preprocessing         : 0.017 s
% 8.32/2.48  # ...main loop             : 0.013 s
% 8.32/2.48  # Maximum resident set size: 7132 pages
% 8.32/2.48  
%------------------------------------------------------------------------------