TSTP Solution File: SWV469+1 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SWV469+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% 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 : Wed Jul 20 21:29:23 EDT 2022

% Result   : Theorem 256.44s 32.54s
% Output   : Proof 256.44s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    sPE(queue(host(sK5)),cons(m_Down(sK6),sK3)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).

cnf(g1,plain,
    setIn(sK5,alive),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).

cnf(g2,plain,
    ~ sPE(host(sK5),host(sK8)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).

cnf(g3,plain,
    ~ leq(s(host(sK5)),host(sK8)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).

cnf(g4,plain,
    setIn(sK8,alive),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).

cnf(g5,plain,
    sPE(index(ldr,host(sK8)),host(sK8)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).

cnf(g6,plain,
    sPE(index(status,host(sK8)),norm),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).

cnf(g7,plain,
    ( ~ sPE(queue(host(sK5)),cons(m_Down(sK6),sK3))
    | sPE(cons(m_Down(sK6),sK3),queue(host(sK5))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    ( ~ leq(host(sK5),host(sK8))
    | ~ leq(host(sK8),host(sK5))
    | sPE(host(sK5),host(sK8)) ),
    inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_61)]) ).

cnf(g9,plain,
    ( leq(s(host(sK5)),host(sK8))
    | leq(host(sK8),s(host(sK5))) ),
    inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_60)]) ).

cnf(g10,plain,
    ( ~ sPE(host(sK8),s(host(sK5)))
    | leq(s(host(sK5)),host(sK8)) ),
    inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_61)]) ).

cnf(g11,plain,
    ( ~ sPE(index(status,host(sK8)),norm)
    | ~ sPE(index(ldr,host(sK8)),host(sK8))
    | ~ setIn(sK5,alive)
    | ~ setIn(sK8,alive)
    | ~ setIn(host(sK8),index(down,host(sK5))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).

cnf(g12,plain,
    ( ~ leq(s(zero),host(sK8))
    | sPE(host(sK8),host(sK6))
    | setIn(host(sK8),index(down,host(sK5)))
    | leq(host(sK5),host(sK8)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).

cnf(g13,plain,
    ( ~ leq(host(sK8),s(host(sK5)))
    | sPE(host(sK8),s(host(sK5)))
    | leq(host(sK8),host(sK5)) ),
    inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_64)]) ).

cnf(g14,plain,
    leq(s(zero),host(sK8)),
    inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_02)]) ).

cnf(g15,plain,
    ( ~ sPE(host(sK8),host(sK6))
    | sPE(host(sK6),host(sK8)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g16,plain,
    sPE(head(cons(m_Down(sK6),alive)),m_Down(sK6)),
    inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_35)]) ).

cnf(g17,plain,
    ( ~ sPE(host(sK6),host(sK8))
    | ~ sPE(index(status,host(sK8)),norm)
    | ~ sPE(index(ldr,host(sK8)),host(sK8))
    | ~ elem(m_Down(sK6),queue(host(sK5)))
    | ~ setIn(sK5,alive)
    | ~ setIn(sK8,alive) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).

cnf(g18,plain,
    ( ~ sPE(head(cons(m_Down(sK6),alive)),m_Down(sK6))
    | ~ sPE(cons(m_Down(sK6),sK3),queue(host(sK5)))
    | ~ elem(head(cons(m_Down(sK6),alive)),cons(m_Down(sK6),sK3))
    | elem(m_Down(sK6),queue(host(sK5))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g19,plain,
    ( ~ sPE(head(cons(m_Down(sK6),alive)),m_Down(sK6))
    | elem(head(cons(m_Down(sK6),alive)),cons(m_Down(sK6),sK3)) ),
    inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_46)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SWV469+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13  % Command  : satcop --statistics %s
% 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 : Tue Jun 14 22:13:26 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 256.44/32.54  % symbols: 50
% 256.44/32.54  % clauses: 160
% 256.44/32.54  % start clauses: 35
% 256.44/32.54  % iterative deepening steps: 6840
% 256.44/32.54  % maximum path limit: 3
% 256.44/32.54  % literal attempts: 98966182
% 256.44/32.54  % depth failures: 90856687
% 256.44/32.54  % regularity failures: 2193645
% 256.44/32.54  % tautology failures: 800480
% 256.44/32.54  % reductions: 512411
% 256.44/32.54  % extensions: 98230171
% 256.44/32.54  % SAT variables: 1103529
% 256.44/32.54  % SAT clauses: 1249952
% 256.44/32.54  % WalkSAT solutions: 1249370
% 256.44/32.54  % CDCL solutions: 575
% 256.44/32.54  % SZS status Theorem for theBenchmark
% 256.44/32.54  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------