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

View Problem - Process Solution

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

% Computer : n018.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:22 EDT 2022

% Result   : Theorem 9.25s 2.63s
% Output   : CNFRefutation 9.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   44 (  22 unt;  10 nHn;  44 RR)
%            Number of literals    :  188 (  80 equ; 130 neg)
%            Maximal clause size   :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-8 aty)
%            Number of variables   :   99 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_29,plain,
    ( rR(X1,X2,X3)
    | X3 != X4
    | X2 != X5
    | X1 != X6
    | ~ rpoint(X4)
    | ~ rpoint(X6)
    | ~ rpoint(X5)
    | ~ rR(X1,X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x40o94um/lgb.p',i_0_29) ).

cnf(i_0_5,plain,
    ( X1 = X2
    | X3 = X4
    | rR(vskolem1120(X1,X5,X2,X6,X3,X7,X4,X8),X1,X2)
    | X2 != X6
    | X1 != X5
    | X4 != X8
    | X3 != X7
    | ~ rpoint(X5)
    | ~ rpoint(X6)
    | ~ rpoint(X7)
    | ~ rpoint(X8)
    | ~ rless(vf(X3,X4),vf(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x40o94um/lgb.p',i_0_5) ).

cnf(i_0_6,plain,
    ( X1 = X2
    | X3 = X4
    | rpoint(vskolem1120(X1,X5,X2,X6,X3,X7,X4,X8))
    | X2 != X6
    | X1 != X5
    | X4 != X8
    | X3 != X7
    | ~ rpoint(X5)
    | ~ rpoint(X6)
    | ~ rpoint(X7)
    | ~ rpoint(X8)
    | ~ rless(vf(X3,X4),vf(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x40o94um/lgb.p',i_0_6) ).

cnf(i_0_80,plain,
    rpoint(esk11_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x40o94um/lgb.p',i_0_80) ).

cnf(i_0_81,plain,
    vd1361 = esk11_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x40o94um/lgb.p',i_0_81) ).

cnf(i_0_78,plain,
    rpoint(esk10_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x40o94um/lgb.p',i_0_78) ).

cnf(i_0_79,plain,
    vd1363 = esk10_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x40o94um/lgb.p',i_0_79) ).

cnf(i_0_1,negated_conjecture,
    ( vf(vd1363,X1) != vf(vd1361,vd1362)
    | ~ rpoint(X1)
    | ~ rR(X1,vd1361,vd1363) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x40o94um/lgb.p',i_0_1) ).

cnf(i_0_76,plain,
    vd1361 != vd1363,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x40o94um/lgb.p',i_0_76) ).

cnf(i_0_4,plain,
    ( X1 = X2
    | X3 = X4
    | vf(X1,vskolem1120(X1,X5,X2,X6,X3,X7,X4,X8)) = vf(X3,X4)
    | X2 != X6
    | X1 != X5
    | X4 != X8
    | X3 != X7
    | ~ rpoint(X5)
    | ~ rpoint(X6)
    | ~ rpoint(X7)
    | ~ rpoint(X8)
    | ~ rless(vf(X3,X4),vf(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x40o94um/lgb.p',i_0_4) ).

cnf(i_0_21,plain,
    ( vf(X1,X2) = vf(X2,X1)
    | X2 != X3
    | X1 != X4
    | ~ rpoint(X3)
    | ~ rpoint(X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x40o94um/lgb.p',i_0_21) ).

cnf(i_0_12,plain,
    rpoint(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x40o94um/lgb.p',i_0_12) ).

cnf(i_0_13,plain,
    vd1362 = esk1_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x40o94um/lgb.p',i_0_13) ).

cnf(i_0_2,plain,
    rless(vf(vd1361,vd1362),vf(vd1361,vd1363)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x40o94um/lgb.p',i_0_2) ).

cnf(i_0_77,plain,
    vd1361 != vd1362,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x40o94um/lgb.p',i_0_77) ).

cnf(c_0_97,plain,
    ( rR(X1,X2,X3)
    | X3 != X4
    | X2 != X5
    | X1 != X6
    | ~ rpoint(X4)
    | ~ rpoint(X6)
    | ~ rpoint(X5)
    | ~ rR(X1,X3,X2) ),
    i_0_29 ).

cnf(c_0_98,plain,
    ( X1 = X2
    | X3 = X4
    | rR(vskolem1120(X1,X5,X2,X6,X3,X7,X4,X8),X1,X2)
    | X2 != X6
    | X1 != X5
    | X4 != X8
    | X3 != X7
    | ~ rpoint(X5)
    | ~ rpoint(X6)
    | ~ rpoint(X7)
    | ~ rpoint(X8)
    | ~ rless(vf(X3,X4),vf(X1,X2)) ),
    i_0_5 ).

cnf(c_0_99,plain,
    ( X1 = X2
    | X3 = X4
    | rpoint(vskolem1120(X1,X5,X2,X6,X3,X7,X4,X8))
    | X2 != X6
    | X1 != X5
    | X4 != X8
    | X3 != X7
    | ~ rpoint(X5)
    | ~ rpoint(X6)
    | ~ rpoint(X7)
    | ~ rpoint(X8)
    | ~ rless(vf(X3,X4),vf(X1,X2)) ),
    i_0_6 ).

cnf(c_0_100,plain,
    ( rR(X1,X2,X3)
    | ~ rR(X1,X3,X2)
    | ~ rpoint(X1)
    | ~ rpoint(X2)
    | ~ rpoint(X3) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_97])])]) ).

cnf(c_0_101,plain,
    ( X1 = X2
    | X3 = X4
    | rR(vskolem1120(X3,X3,X4,X4,X1,X1,X2,X2),X3,X4)
    | ~ rless(vf(X1,X2),vf(X3,X4))
    | ~ rpoint(X2)
    | ~ rpoint(X1)
    | ~ rpoint(X4)
    | ~ rpoint(X3) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_98])])])]) ).

cnf(c_0_102,plain,
    ( X1 = X2
    | X3 = X4
    | rpoint(vskolem1120(X3,X3,X4,X4,X1,X1,X2,X2))
    | ~ rless(vf(X1,X2),vf(X3,X4))
    | ~ rpoint(X2)
    | ~ rpoint(X1)
    | ~ rpoint(X4)
    | ~ rpoint(X3) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_99])])])]) ).

cnf(c_0_103,plain,
    rpoint(esk11_0),
    i_0_80 ).

cnf(c_0_104,plain,
    vd1361 = esk11_0,
    i_0_81 ).

cnf(c_0_105,plain,
    rpoint(esk10_0),
    i_0_78 ).

cnf(c_0_106,plain,
    vd1363 = esk10_0,
    i_0_79 ).

cnf(c_0_107,negated_conjecture,
    ( vf(vd1363,X1) != vf(vd1361,vd1362)
    | ~ rpoint(X1)
    | ~ rR(X1,vd1361,vd1363) ),
    i_0_1 ).

cnf(c_0_108,plain,
    ( X1 = X2
    | X3 = X4
    | rR(vskolem1120(X1,X1,X2,X2,X3,X3,X4,X4),X2,X1)
    | ~ rless(vf(X3,X4),vf(X1,X2))
    | ~ rpoint(X2)
    | ~ rpoint(X1)
    | ~ rpoint(X4)
    | ~ rpoint(X3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]) ).

cnf(c_0_109,plain,
    rpoint(vd1361),
    inference(rw,[status(thm)],[c_0_103,c_0_104]) ).

cnf(c_0_110,plain,
    rpoint(vd1363),
    inference(rw,[status(thm)],[c_0_105,c_0_106]) ).

cnf(c_0_111,plain,
    vd1361 != vd1363,
    i_0_76 ).

cnf(c_0_112,plain,
    ( X1 = X2
    | X3 = X4
    | vf(X1,vskolem1120(X1,X5,X2,X6,X3,X7,X4,X8)) = vf(X3,X4)
    | X2 != X6
    | X1 != X5
    | X4 != X8
    | X3 != X7
    | ~ rpoint(X5)
    | ~ rpoint(X6)
    | ~ rpoint(X7)
    | ~ rpoint(X8)
    | ~ rless(vf(X3,X4),vf(X1,X2)) ),
    i_0_4 ).

cnf(c_0_113,negated_conjecture,
    ( X1 = X2
    | vf(vd1363,vskolem1120(vd1363,vd1363,vd1361,vd1361,X1,X1,X2,X2)) != vf(vd1361,vd1362)
    | ~ rless(vf(X1,X2),vf(vd1363,vd1361))
    | ~ rpoint(vskolem1120(vd1363,vd1363,vd1361,vd1361,X1,X1,X2,X2))
    | ~ rpoint(X2)
    | ~ rpoint(X1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109]),c_0_110])]),c_0_111]) ).

cnf(c_0_114,plain,
    ( vf(X1,vskolem1120(X1,X1,X2,X2,X3,X3,X4,X4)) = vf(X3,X4)
    | X3 = X4
    | X1 = X2
    | ~ rless(vf(X3,X4),vf(X1,X2))
    | ~ rpoint(X4)
    | ~ rpoint(X3)
    | ~ rpoint(X2)
    | ~ rpoint(X1) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_112])])])]) ).

cnf(c_0_115,plain,
    ( X1 = X2
    | vf(X1,X2) != vf(vd1361,vd1362)
    | ~ rless(vf(X1,X2),vf(vd1363,vd1361))
    | ~ rpoint(vskolem1120(vd1363,vd1363,vd1361,vd1361,X1,X1,X2,X2))
    | ~ rpoint(X2)
    | ~ rpoint(X1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_109]),c_0_110])]),c_0_111]) ).

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

cnf(c_0_117,plain,
    ( X1 = X2
    | vf(X1,X2) != vf(vd1361,vd1362)
    | ~ rless(vf(X1,X2),vf(vd1363,vd1361))
    | ~ rpoint(X2)
    | ~ rpoint(X1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_102]),c_0_109]),c_0_110])]),c_0_111]) ).

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

cnf(c_0_119,plain,
    rpoint(esk1_0),
    i_0_12 ).

cnf(c_0_120,plain,
    vd1362 = esk1_0,
    i_0_13 ).

cnf(c_0_121,plain,
    ( X1 = X2
    | vf(X1,X2) != vf(vd1361,vd1362)
    | ~ rless(vf(X1,X2),vf(vd1361,vd1363))
    | ~ rpoint(X2)
    | ~ rpoint(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_110]),c_0_109])]) ).

cnf(c_0_122,plain,
    rless(vf(vd1361,vd1362),vf(vd1361,vd1363)),
    i_0_2 ).

cnf(c_0_123,plain,
    rpoint(vd1362),
    inference(rw,[status(thm)],[c_0_119,c_0_120]) ).

cnf(c_0_124,plain,
    vd1361 != vd1362,
    i_0_77 ).

cnf(c_0_125,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_123]),c_0_109])]),c_0_124]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GEO336+1 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n018.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 09:10:34 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 9.25/2.63  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.25/2.63  # No SInE strategy applied
% 9.25/2.63  # Trying AutoSched0 for 150 seconds
% 9.25/2.63  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 9.25/2.63  # and selection function SelectMaxLComplexAvoidPosPred.
% 9.25/2.63  #
% 9.25/2.63  # Preprocessing time       : 0.025 s
% 9.25/2.63  
% 9.25/2.63  # Proof found!
% 9.25/2.63  # SZS status Theorem
% 9.25/2.63  # SZS output start CNFRefutation
% See solution above
% 9.25/2.63  # Training examples: 0 positive, 0 negative
% 9.25/2.63  
% 9.25/2.63  # -------------------------------------------------
% 9.25/2.63  # User time                : 0.075 s
% 9.25/2.63  # System time              : 0.006 s
% 9.25/2.63  # Total time               : 0.081 s
% 9.25/2.63  # Maximum resident set size: 7124 pages
% 9.25/2.63  
%------------------------------------------------------------------------------