↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n025.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 : Fri Jul 15 02:47:15 EDT 2022

% Result   : Theorem 4.59s 2.20s
% Output   : CNFRefutation 4.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   37 (   8 unt;   0 nHn;  35 RR)
%            Number of literals    :   66 (   0 equ;  34 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   38 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_16,plain,
    ( inanimateobject(X1)
    | ~ inanimateobject_nonnatural(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-67opv19t/lgb.p',i_0_16) ).

cnf(i_0_14,plain,
    ( inanimateobject_nonnatural(X1)
    | ~ artifact(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-67opv19t/lgb.p',i_0_14) ).

cnf(i_0_9,plain,
    ( artifact(X1)
    | ~ computerdataartifact(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-67opv19t/lgb.p',i_0_9) ).

cnf(i_0_18,plain,
    ( partiallytangible(X1)
    | ~ inanimateobject(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-67opv19t/lgb.p',i_0_18) ).

cnf(i_0_11,plain,
    ( mathematicalorcomputationalthing(X1)
    | ~ mathematicalthing(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-67opv19t/lgb.p',i_0_11) ).

cnf(i_0_2,plain,
    ( mathematicalthing(X1)
    | ~ setorcollection(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-67opv19t/lgb.p',i_0_2) ).

cnf(i_0_7,plain,
    ( ~ intangible(X1)
    | ~ partiallytangible(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-67opv19t/lgb.p',i_0_7) ).

cnf(i_0_5,plain,
    ( intangible(X1)
    | ~ mathematicalorcomputationalthing(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-67opv19t/lgb.p',i_0_5) ).

cnf(i_0_81,plain,
    ( disjointwith(X1,X2)
    | ~ disjointwith(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-67opv19t/lgb.p',i_0_81) ).

cnf(i_0_116,negated_conjecture,
    disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-67opv19t/lgb.p',i_0_116) ).

cnf(i_0_22,plain,
    ( no(X1,X2)
    | ~ disjointwith(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-67opv19t/lgb.p',i_0_22) ).

cnf(i_0_95,plain,
    computerdataartifact(f_urlreferentfn(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-67opv19t/lgb.p',i_0_95) ).

cnf(i_0_43,plain,
    ( setorcollection(X1)
    | ~ no(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-67opv19t/lgb.p',i_0_43) ).

cnf(c_0_130,plain,
    ( inanimateobject(X1)
    | ~ inanimateobject_nonnatural(X1) ),
    i_0_16 ).

cnf(c_0_131,plain,
    ( inanimateobject_nonnatural(X1)
    | ~ artifact(X1) ),
    i_0_14 ).

cnf(c_0_132,plain,
    ( inanimateobject(X1)
    | ~ artifact(X1) ),
    inference(spm,[status(thm)],[c_0_130,c_0_131]) ).

cnf(c_0_133,plain,
    ( artifact(X1)
    | ~ computerdataartifact(X1) ),
    i_0_9 ).

cnf(c_0_134,plain,
    ( partiallytangible(X1)
    | ~ inanimateobject(X1) ),
    i_0_18 ).

cnf(c_0_135,plain,
    ( inanimateobject(X1)
    | ~ computerdataartifact(X1) ),
    inference(spm,[status(thm)],[c_0_132,c_0_133]) ).

cnf(c_0_136,plain,
    ( mathematicalorcomputationalthing(X1)
    | ~ mathematicalthing(X1) ),
    i_0_11 ).

cnf(c_0_137,plain,
    ( mathematicalthing(X1)
    | ~ setorcollection(X1) ),
    i_0_2 ).

cnf(c_0_138,plain,
    ( ~ intangible(X1)
    | ~ partiallytangible(X1) ),
    i_0_7 ).

cnf(c_0_139,plain,
    ( partiallytangible(X1)
    | ~ computerdataartifact(X1) ),
    inference(spm,[status(thm)],[c_0_134,c_0_135]) ).

cnf(c_0_140,plain,
    ( intangible(X1)
    | ~ mathematicalorcomputationalthing(X1) ),
    i_0_5 ).

cnf(c_0_141,plain,
    ( mathematicalorcomputationalthing(X1)
    | ~ setorcollection(X1) ),
    inference(spm,[status(thm)],[c_0_136,c_0_137]) ).

cnf(c_0_142,plain,
    ( disjointwith(X1,X2)
    | ~ disjointwith(X2,X1) ),
    i_0_81 ).

cnf(c_0_143,negated_conjecture,
    disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
    i_0_116 ).

cnf(c_0_144,plain,
    ( ~ computerdataartifact(X1)
    | ~ intangible(X1) ),
    inference(spm,[status(thm)],[c_0_138,c_0_139]) ).

cnf(c_0_145,plain,
    ( intangible(X1)
    | ~ setorcollection(X1) ),
    inference(spm,[status(thm)],[c_0_140,c_0_141]) ).

cnf(c_0_146,plain,
    ( no(X1,X2)
    | ~ disjointwith(X1,X2) ),
    i_0_22 ).

cnf(c_0_147,negated_conjecture,
    disjointwith(c_tptpcol_16_118949,f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf))),
    inference(spm,[status(thm)],[c_0_142,c_0_143]) ).

cnf(c_0_148,plain,
    ( ~ computerdataartifact(X1)
    | ~ setorcollection(X1) ),
    inference(spm,[status(thm)],[c_0_144,c_0_145]) ).

cnf(c_0_149,plain,
    computerdataartifact(f_urlreferentfn(X1)),
    i_0_95 ).

cnf(c_0_150,plain,
    ( setorcollection(X1)
    | ~ no(X2,X1) ),
    i_0_43 ).

cnf(c_0_151,plain,
    no(c_tptpcol_16_118949,f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf))),
    inference(spm,[status(thm)],[c_0_146,c_0_147]) ).

cnf(c_0_152,plain,
    ~ setorcollection(f_urlreferentfn(X1)),
    inference(spm,[status(thm)],[c_0_148,c_0_149]) ).

cnf(c_0_153,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_151]),c_0_152]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR063+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n025.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 11 01:50:09 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 4.59/2.20  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.59/2.20  # No SInE strategy applied
% 4.59/2.20  # Trying AutoSched0 for 150 seconds
% 4.59/2.20  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.59/2.20  # and selection function SelectComplexExceptUniqMaxHorn.
% 4.59/2.20  #
% 4.59/2.20  # Preprocessing time       : 0.024 s
% 4.59/2.20  # Presaturation interreduction done
% 4.59/2.20  
% 4.59/2.20  # Proof found!
% 4.59/2.20  # SZS status Theorem
% 4.59/2.20  # SZS output start CNFRefutation
% See solution above
% 4.59/2.20  # Training examples: 0 positive, 0 negative
% 4.59/2.20  
% 4.59/2.20  # -------------------------------------------------
% 4.59/2.20  # User time                : 0.029 s
% 4.59/2.20  # System time              : 0.006 s
% 4.59/2.20  # Total time               : 0.035 s
% 4.59/2.20  # Maximum resident set size: 7120 pages
% 4.59/2.20  
%------------------------------------------------------------------------------