TSTP Solution File: SWV381+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SWV381+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n009.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 : Wed Jul 20 17:47:02 EDT 2022

% Result   : Theorem 7.48s 2.34s
% Output   : CNFRefutation 7.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   22 (   7 unt;   9 nHn;  15 RR)
%            Number of literals    :   41 (   0 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   40 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_87,plain,
    ( less_than(X1,X2)
    | strictly_less_than(X2,X1)
    | ~ less_than(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gkwb_p5m/lgb.p',i_0_87) ).

cnf(i_0_90,plain,
    ( less_than(X1,X2)
    | less_than(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gkwb_p5m/lgb.p',i_0_90) ).

cnf(i_0_1,plain,
    ( issmallestelement_pq(X1,X2)
    | ~ less_than(X2,esk1_2(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gkwb_p5m/lgb.p',i_0_1) ).

cnf(i_0_81,negated_conjecture,
    ~ issmallestelement_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gkwb_p5m/lgb.p',i_0_81) ).

cnf(i_0_84,lemma,
    ( contains_cpq(triple(X1,X2,X3),X4)
    | ~ contains_pq(i(triple(X1,X2,X3)),X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gkwb_p5m/lgb.p',i_0_84) ).

cnf(i_0_2,plain,
    ( issmallestelement_pq(X1,X2)
    | contains_pq(X1,esk1_2(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gkwb_p5m/lgb.p',i_0_2) ).

cnf(i_0_83,lemma,
    ( ~ contains_cpq(triple(X1,X2,X3),X4)
    | ~ phi(findmin_cpq_eff(triple(X1,X2,X3)))
    | ~ strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gkwb_p5m/lgb.p',i_0_83) ).

cnf(i_0_82,negated_conjecture,
    phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gkwb_p5m/lgb.p',i_0_82) ).

cnf(c_0_99,plain,
    ( less_than(X1,X2)
    | strictly_less_than(X2,X1)
    | ~ less_than(X2,X1) ),
    i_0_87 ).

cnf(c_0_100,plain,
    ( less_than(X1,X2)
    | less_than(X2,X1) ),
    i_0_90 ).

cnf(c_0_101,plain,
    ( issmallestelement_pq(X1,X2)
    | ~ less_than(X2,esk1_2(X1,X2)) ),
    i_0_1 ).

cnf(c_0_102,plain,
    ( less_than(X1,X2)
    | strictly_less_than(X2,X1) ),
    inference(csr,[status(thm)],[c_0_99,c_0_100]) ).

cnf(c_0_103,negated_conjecture,
    ~ issmallestelement_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))),
    i_0_81 ).

cnf(c_0_104,plain,
    ( strictly_less_than(esk1_2(X1,X2),X2)
    | issmallestelement_pq(X1,X2) ),
    inference(spm,[status(thm)],[c_0_101,c_0_102]) ).

cnf(c_0_105,lemma,
    ( contains_cpq(triple(X1,X2,X3),X4)
    | ~ contains_pq(i(triple(X1,X2,X3)),X4) ),
    i_0_84 ).

cnf(c_0_106,plain,
    ( issmallestelement_pq(X1,X2)
    | contains_pq(X1,esk1_2(X1,X2)) ),
    i_0_2 ).

cnf(c_0_107,lemma,
    ( ~ contains_cpq(triple(X1,X2,X3),X4)
    | ~ phi(findmin_cpq_eff(triple(X1,X2,X3)))
    | ~ strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) ),
    i_0_83 ).

cnf(c_0_108,negated_conjecture,
    strictly_less_than(esk1_2(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))),
    inference(spm,[status(thm)],[c_0_103,c_0_104]) ).

cnf(c_0_109,negated_conjecture,
    phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))),
    i_0_82 ).

cnf(c_0_110,plain,
    ( contains_cpq(triple(X1,X2,X3),esk1_2(i(triple(X1,X2,X3)),X4))
    | issmallestelement_pq(i(triple(X1,X2,X3)),X4) ),
    inference(spm,[status(thm)],[c_0_105,c_0_106]) ).

cnf(c_0_111,lemma,
    ~ contains_cpq(triple(esk5_0,esk6_0,esk7_0),esk1_2(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109])]) ).

cnf(c_0_112,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_110]),c_0_111]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SWV381+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n009.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Tue Jun 14 18:52:25 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.18/0.43  # ENIGMATIC: Selected SinE mode:
% 0.18/0.44  # Parsing /export/starexec/sandbox2/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
% 7.48/2.34  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.48/2.34  # No SInE strategy applied
% 7.48/2.34  # Trying AutoSched0 for 150 seconds
% 7.48/2.34  # AutoSched0-Mode selected heuristic G_E___208_B01_00_F1_SE_CS_SP_PS_S04AN
% 7.48/2.34  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.48/2.34  #
% 7.48/2.34  # Preprocessing time       : 0.023 s
% 7.48/2.34  # Presaturation interreduction done
% 7.48/2.34  
% 7.48/2.34  # Proof found!
% 7.48/2.34  # SZS status Theorem
% 7.48/2.34  # SZS output start CNFRefutation
% See solution above
% 7.48/2.34  # Training examples: 0 positive, 0 negative
% 7.48/2.34  
% 7.48/2.34  # -------------------------------------------------
% 7.48/2.34  # User time                : 0.031 s
% 7.48/2.34  # System time              : 0.006 s
% 7.48/2.34  # Total time               : 0.037 s
% 7.48/2.34  # Maximum resident set size: 7124 pages
% 7.48/2.34  
%------------------------------------------------------------------------------