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

View Problem - Process Solution

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

% Computer : n029.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 : Thu Jul 21 04:58:30 EDT 2022

% Result   : Theorem 8.16s 2.57s
% Output   : CNFRefutation 8.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   18 (   7 unt;   3 nHn;  15 RR)
%            Number of literals    :   38 (   0 equ;  16 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   23 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,negated_conjecture,
    ( a_member_of(X1,X2)
    | ~ eq(X3,X2)
    | ~ a_member_of(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-njtridxy/input.p',i_0_6) ).

cnf(i_0_2,negated_conjecture,
    eq(esk2_0,esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-njtridxy/input.p',i_0_2) ).

cnf(i_0_3,negated_conjecture,
    ( eq(X1,X2)
    | a_member_of(esk1_2(X1,X2),X2)
    | a_member_of(esk1_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-njtridxy/input.p',i_0_3) ).

cnf(i_0_5,negated_conjecture,
    ( a_member_of(X1,X2)
    | ~ eq(X2,X3)
    | ~ a_member_of(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-njtridxy/input.p',i_0_5) ).

cnf(i_0_1,negated_conjecture,
    ~ eq(esk3_0,esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-njtridxy/input.p',i_0_1) ).

cnf(i_0_4,negated_conjecture,
    ( eq(X1,X2)
    | ~ a_member_of(esk1_2(X1,X2),X2)
    | ~ a_member_of(esk1_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-njtridxy/input.p',i_0_4) ).

cnf(c_0_13,negated_conjecture,
    ( a_member_of(X1,X2)
    | ~ eq(X3,X2)
    | ~ a_member_of(X1,X3) ),
    i_0_6 ).

cnf(c_0_14,negated_conjecture,
    eq(esk2_0,esk3_0),
    i_0_2 ).

cnf(c_0_15,negated_conjecture,
    ( a_member_of(X1,esk3_0)
    | ~ a_member_of(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,negated_conjecture,
    ( eq(X1,X2)
    | a_member_of(esk1_2(X1,X2),X2)
    | a_member_of(esk1_2(X1,X2),X1) ),
    i_0_3 ).

cnf(c_0_17,negated_conjecture,
    ( a_member_of(X1,X2)
    | ~ eq(X2,X3)
    | ~ a_member_of(X1,X3) ),
    i_0_5 ).

cnf(c_0_18,negated_conjecture,
    ( a_member_of(esk1_2(X1,esk2_0),esk3_0)
    | a_member_of(esk1_2(X1,esk2_0),X1)
    | eq(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    ~ eq(esk3_0,esk2_0),
    i_0_1 ).

cnf(c_0_20,negated_conjecture,
    ( a_member_of(X1,esk2_0)
    | ~ a_member_of(X1,esk3_0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_14]) ).

cnf(c_0_21,negated_conjecture,
    a_member_of(esk1_2(esk3_0,esk2_0),esk3_0),
    inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_18]),c_0_19]) ).

cnf(c_0_22,negated_conjecture,
    ( eq(X1,X2)
    | ~ a_member_of(esk1_2(X1,X2),X2)
    | ~ a_member_of(esk1_2(X1,X2),X1) ),
    i_0_4 ).

cnf(c_0_23,negated_conjecture,
    a_member_of(esk1_2(esk3_0,esk2_0),esk2_0),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_21])]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN966+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n029.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 19:52:04 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 8.16/2.57  # ENIGMATIC: Solved by autoschedule:
% 8.16/2.57  # No SInE strategy applied
% 8.16/2.57  # Trying AutoSched0 for 150 seconds
% 8.16/2.57  # AutoSched0-Mode selected heuristic G_E___042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 8.16/2.57  # and selection function SelectNewComplexAHPNS.
% 8.16/2.57  #
% 8.16/2.57  # Preprocessing time       : 0.013 s
% 8.16/2.57  # Presaturation interreduction done
% 8.16/2.57  
% 8.16/2.57  # Proof found!
% 8.16/2.57  # SZS status Theorem
% 8.16/2.57  # SZS output start CNFRefutation
% See solution above
% 8.16/2.57  # Training examples: 0 positive, 0 negative
% 8.16/2.57  
% 8.16/2.57  # -------------------------------------------------
% 8.16/2.57  # User time                : 0.013 s
% 8.16/2.57  # System time              : 0.004 s
% 8.16/2.57  # Total time               : 0.017 s
% 8.16/2.57  # Maximum resident set size: 7124 pages
% 8.16/2.57  
%------------------------------------------------------------------------------