↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n014.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 : Tue Jul 19 08:41:36 EDT 2022

% Result   : Theorem 7.70s 2.36s
% Output   : CNFRefutation 7.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   25 (  19 unt;   4 nHn;  10 RR)
%            Number of literals    :   43 (  14 equ;  19 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-2 aty)
%            Number of variables   :   24 (  13 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_57,plain,
    ( join_on_relstr(X1,empty_set) = bottom_of_relstr(X1)
    | ~ rel_str(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9l76eptm/lgb.p',i_0_57) ).

cnf(i_0_85,plain,
    rel_str(poset_of_lattice(boole_lattice(X1))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9l76eptm/lgb.p',i_0_85) ).

cnf(i_0_363,negated_conjecture,
    bottom_of_relstr(poset_of_lattice(boole_lattice(esk29_0))) != empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9l76eptm/lgb.p',i_0_363) ).

cnf(i_0_366,plain,
    ( join_on_relstr(poset_of_lattice(X1),X2) = join_of_latt_set(X1,X2)
    | empty_carrier(X1)
    | ~ latt_str(X1)
    | ~ lattice(X1)
    | ~ complete_latt_str(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9l76eptm/lgb.p',i_0_366) ).

cnf(i_0_114,plain,
    complete_latt_str(boole_lattice(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9l76eptm/lgb.p',i_0_114) ).

cnf(i_0_174,plain,
    lattice(boole_lattice(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9l76eptm/lgb.p',i_0_174) ).

cnf(i_0_67,plain,
    latt_str(boole_lattice(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9l76eptm/lgb.p',i_0_67) ).

cnf(i_0_182,plain,
    ~ empty_carrier(boole_lattice(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9l76eptm/lgb.p',i_0_182) ).

cnf(i_0_375,plain,
    ( join_of_latt_set(X1,empty_set) = bottom_of_semilattstr(X1)
    | empty_carrier(X1)
    | ~ latt_str(X1)
    | ~ lattice(X1)
    | ~ complete_latt_str(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9l76eptm/lgb.p',i_0_375) ).

cnf(i_0_370,plain,
    bottom_of_semilattstr(boole_lattice(X1)) = empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9l76eptm/lgb.p',i_0_370) ).

cnf(c_0_386,plain,
    ( join_on_relstr(X1,empty_set) = bottom_of_relstr(X1)
    | ~ rel_str(X1) ),
    i_0_57 ).

cnf(c_0_387,plain,
    rel_str(poset_of_lattice(boole_lattice(X1))),
    i_0_85 ).

cnf(c_0_388,negated_conjecture,
    bottom_of_relstr(poset_of_lattice(boole_lattice(esk29_0))) != empty_set,
    i_0_363 ).

cnf(c_0_389,plain,
    bottom_of_relstr(poset_of_lattice(boole_lattice(X1))) = join_on_relstr(poset_of_lattice(boole_lattice(X1)),empty_set),
    inference(spm,[status(thm)],[c_0_386,c_0_387]) ).

cnf(c_0_390,plain,
    ( join_on_relstr(poset_of_lattice(X1),X2) = join_of_latt_set(X1,X2)
    | empty_carrier(X1)
    | ~ latt_str(X1)
    | ~ lattice(X1)
    | ~ complete_latt_str(X1) ),
    i_0_366 ).

cnf(c_0_391,plain,
    complete_latt_str(boole_lattice(X1)),
    i_0_114 ).

cnf(c_0_392,plain,
    lattice(boole_lattice(X1)),
    i_0_174 ).

cnf(c_0_393,plain,
    latt_str(boole_lattice(X1)),
    i_0_67 ).

cnf(c_0_394,plain,
    ~ empty_carrier(boole_lattice(X1)),
    i_0_182 ).

cnf(c_0_395,plain,
    ( join_of_latt_set(X1,empty_set) = bottom_of_semilattstr(X1)
    | empty_carrier(X1)
    | ~ latt_str(X1)
    | ~ lattice(X1)
    | ~ complete_latt_str(X1) ),
    i_0_375 ).

cnf(c_0_396,plain,
    bottom_of_semilattstr(boole_lattice(X1)) = empty_set,
    i_0_370 ).

cnf(c_0_397,negated_conjecture,
    join_on_relstr(poset_of_lattice(boole_lattice(esk29_0)),empty_set) != empty_set,
    inference(rw,[status(thm)],[c_0_388,c_0_389]) ).

cnf(c_0_398,plain,
    join_on_relstr(poset_of_lattice(boole_lattice(X1)),X2) = join_of_latt_set(boole_lattice(X1),X2),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_390,c_0_391]),c_0_392]),c_0_393])]),c_0_394]) ).

cnf(c_0_399,plain,
    join_of_latt_set(boole_lattice(X1),empty_set) = empty_set,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_395,c_0_391]),c_0_396]),c_0_392]),c_0_393])]),c_0_394]) ).

cnf(c_0_400,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_397,c_0_398]),c_0_399])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU371+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n014.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 : Sun Jun 19 05:19:35 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.70/2.36  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.70/2.36  # No SInE strategy applied
% 7.70/2.36  # Trying AutoSched0 for 150 seconds
% 7.70/2.36  # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 7.70/2.36  # and selection function SelectCQArEqLast.
% 7.70/2.36  #
% 7.70/2.36  # Preprocessing time       : 0.024 s
% 7.70/2.36  # Presaturation interreduction done
% 7.70/2.36  
% 7.70/2.36  # Proof found!
% 7.70/2.36  # SZS status Theorem
% 7.70/2.36  # SZS output start CNFRefutation
% See solution above
% 7.70/2.37  # Training examples: 0 positive, 0 negative
% 7.70/2.37  
% 7.70/2.37  # -------------------------------------------------
% 7.70/2.37  # User time                : 0.033 s
% 7.70/2.37  # System time              : 0.005 s
% 7.70/2.37  # Total time               : 0.037 s
% 7.70/2.37  # Maximum resident set size: 7120 pages
% 7.70/2.37  
%------------------------------------------------------------------------------