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

% Computer : n003.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:45:12 EDT 2022

% Result   : Theorem 8.15s 2.51s
% Output   : CNFRefutation 8.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   36 (  29 unt;   0 nHn;  36 RR)
%            Number of literals    :   65 (  34 equ;  33 neg)
%            Maximal clause size   :    8 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_109,plain,
    ( vf(X1,X2) = vf(X2,X1)
    | X2 != X3
    | X1 != X4
    | ~ rpoint(X3)
    | ~ rpoint(X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-syvfghqd/lgb.p',i_0_109) ).

cnf(i_0_7,plain,
    rpoint(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-syvfghqd/lgb.p',i_0_7) ).

cnf(i_0_8,plain,
    vd1201 = esk1_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-syvfghqd/lgb.p',i_0_8) ).

cnf(i_0_37,plain,
    vd1199 = esk8_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-syvfghqd/lgb.p',i_0_37) ).

cnf(i_0_33,plain,
    vd1199 = vd1185,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-syvfghqd/lgb.p',i_0_33) ).

cnf(i_0_53,plain,
    vf(vd1199,vd1201) = vf(vd1185,vd1187),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-syvfghqd/lgb.p',i_0_53) ).

cnf(i_0_36,plain,
    rpoint(esk8_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-syvfghqd/lgb.p',i_0_36) ).

cnf(i_0_1,negated_conjecture,
    vplus(vf(vd1185,vd1187),vf(vd1187,vd1201)) != vf(vd1185,vd1201),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-syvfghqd/lgb.p',i_0_1) ).

cnf(i_0_5,plain,
    ( vplus(vf(X1,X2),vf(X2,X3)) = vf(X1,X3)
    | X3 != X4
    | X1 != X5
    | X2 != X6
    | ~ rpoint(X5)
    | ~ rpoint(X6)
    | ~ rpoint(X4)
    | ~ rR(X2,X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-syvfghqd/lgb.p',i_0_5) ).

cnf(i_0_22,plain,
    rpoint(esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-syvfghqd/lgb.p',i_0_22) ).

cnf(i_0_23,plain,
    vd1187 = esk2_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-syvfghqd/lgb.p',i_0_23) ).

cnf(i_0_2,plain,
    rR(vd1187,vd1185,vd1201),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-syvfghqd/lgb.p',i_0_2) ).

cnf(c_0_122,plain,
    ( vf(X1,X2) = vf(X2,X1)
    | X2 != X3
    | X1 != X4
    | ~ rpoint(X3)
    | ~ rpoint(X4) ),
    i_0_109 ).

cnf(c_0_123,plain,
    rpoint(esk1_0),
    i_0_7 ).

cnf(c_0_124,plain,
    vd1201 = esk1_0,
    i_0_8 ).

cnf(c_0_125,plain,
    vd1199 = esk8_0,
    i_0_37 ).

cnf(c_0_126,plain,
    vd1199 = vd1185,
    i_0_33 ).

cnf(c_0_127,plain,
    vf(vd1199,vd1201) = vf(vd1185,vd1187),
    i_0_53 ).

cnf(c_0_128,plain,
    ( vf(X1,X2) = vf(X2,X1)
    | ~ rpoint(X1)
    | ~ rpoint(X2) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_122])]) ).

cnf(c_0_129,plain,
    rpoint(vd1201),
    inference(rw,[status(thm)],[c_0_123,c_0_124]) ).

cnf(c_0_130,plain,
    rpoint(esk8_0),
    i_0_36 ).

cnf(c_0_131,plain,
    esk8_0 = vd1185,
    inference(rw,[status(thm)],[c_0_125,c_0_126]) ).

cnf(c_0_132,negated_conjecture,
    vplus(vf(vd1185,vd1187),vf(vd1187,vd1201)) != vf(vd1185,vd1201),
    i_0_1 ).

cnf(c_0_133,plain,
    vf(vd1185,vd1201) = vf(vd1185,vd1187),
    inference(rw,[status(thm)],[c_0_127,c_0_126]) ).

cnf(c_0_134,plain,
    ( vf(X1,vd1201) = vf(vd1201,X1)
    | ~ rpoint(X1) ),
    inference(spm,[status(thm)],[c_0_128,c_0_129]) ).

cnf(c_0_135,plain,
    rpoint(vd1185),
    inference(rw,[status(thm)],[c_0_130,c_0_131]) ).

cnf(c_0_136,plain,
    ( vplus(vf(X1,X2),vf(X2,X3)) = vf(X1,X3)
    | X3 != X4
    | X1 != X5
    | X2 != X6
    | ~ rpoint(X5)
    | ~ rpoint(X6)
    | ~ rpoint(X4)
    | ~ rR(X2,X1,X3) ),
    i_0_5 ).

cnf(c_0_137,plain,
    rpoint(esk2_0),
    i_0_22 ).

cnf(c_0_138,plain,
    vd1187 = esk2_0,
    i_0_23 ).

cnf(c_0_139,negated_conjecture,
    vplus(vf(vd1185,vd1187),vf(vd1187,vd1201)) != vf(vd1185,vd1187),
    inference(rw,[status(thm)],[c_0_132,c_0_133]) ).

cnf(c_0_140,plain,
    vf(vd1185,vd1187) = vf(vd1201,vd1185),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_133]) ).

cnf(c_0_141,plain,
    ( vplus(vf(X1,X2),vf(X2,X3)) = vf(X1,X3)
    | ~ rR(X2,X1,X3)
    | ~ rpoint(X2)
    | ~ rpoint(X1)
    | ~ rpoint(X3) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_136])])]) ).

cnf(c_0_142,plain,
    rR(vd1187,vd1185,vd1201),
    i_0_2 ).

cnf(c_0_143,plain,
    rpoint(vd1187),
    inference(rw,[status(thm)],[c_0_137,c_0_138]) ).

cnf(c_0_144,negated_conjecture,
    vplus(vf(vd1201,vd1185),vf(vd1187,vd1201)) != vf(vd1201,vd1185),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_139,c_0_140]),c_0_140]) ).

cnf(c_0_145,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_140]),c_0_133]),c_0_140]),c_0_143]),c_0_135]),c_0_129])]),c_0_144]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GEO300+1 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n003.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 14:29:29 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 8.15/2.51  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.15/2.51  # No SInE strategy applied
% 8.15/2.51  # Trying AutoSched0 for 150 seconds
% 8.15/2.51  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 8.15/2.51  # and selection function SelectCQArNTNpEqFirst.
% 8.15/2.51  #
% 8.15/2.51  # Preprocessing time       : 0.024 s
% 8.15/2.51  # Presaturation interreduction done
% 8.15/2.51  
% 8.15/2.51  # Proof found!
% 8.15/2.51  # SZS status Theorem
% 8.15/2.51  # SZS output start CNFRefutation
% See solution above
% 8.15/2.51  # Training examples: 0 positive, 0 negative
% 8.15/2.51  
% 8.15/2.51  # -------------------------------------------------
% 8.15/2.51  # User time                : 0.029 s
% 8.15/2.51  # System time              : 0.005 s
% 8.15/2.51  # Total time               : 0.033 s
% 8.15/2.51  # Maximum resident set size: 7128 pages
% 8.15/2.51  
%------------------------------------------------------------------------------