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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SWV390+1 : TPTP v8.1.0. Released v3.3.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:28:52 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ check_cpq(triple(sK2,sK3,sK4)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l26_co)]) ).

cnf(g1,plain,
    check_cpq(insert_cpq(triple(sK2,sK3,sK4),sK5)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l26_co)]) ).

cnf(g2,plain,
    ( pair_in_list(sK3,sK0(sK2,sK3,sK4),sK1(sK2,sK3,sK4))
    | check_cpq(triple(sK2,sK3,sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l26_li4142)]) ).

cnf(g3,plain,
    ( ~ less_than(sK1(sK2,sK3,sK4),sK0(sK2,sK3,sK4))
    | check_cpq(triple(sK2,sK3,sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l26_li4142)]) ).

cnf(g4,plain,
    ( pair_in_list(sK3,sK0(sK3,sK3,sK3),sK1(sK3,sK3,sK3))
    | check_cpq(triple(sK3,sK3,sK3)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l26_li4142)]) ).

cnf(g5,plain,
    ( ~ less_than(sK1(sK3,sK3,sK3),sK0(sK3,sK3,sK3))
    | check_cpq(triple(sK3,sK3,sK3)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l26_li4142)]) ).

cnf(g6,plain,
    ( ~ pair_in_list(sK3,sK0(sK2,sK3,sK4),sK1(sK2,sK3,sK4))
    | ~ check_cpq(triple(sK3,sK3,sK3))
    | less_than(sK1(sK2,sK3,sK4),sK0(sK2,sK3,sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l26_li4142)]) ).

cnf(g7,plain,
    ( ~ sPE(insert_cpq(triple(sK2,sK3,sK4),sK5),triple(insert_pqp(sK2,sK5),insert_slb(sK3,pair(sK5,bottom)),sK4))
    | ~ check_cpq(insert_cpq(triple(sK2,sK3,sK4),sK5))
    | check_cpq(triple(insert_pqp(sK2,sK5),insert_slb(sK3,pair(sK5,bottom)),sK4)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    sPE(insert_cpq(triple(sK2,sK3,sK4),sK5),triple(insert_pqp(sK2,sK5),insert_slb(sK3,pair(sK5,bottom)),sK4)),
    inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax42)]) ).

cnf(g9,plain,
    ( ~ pair_in_list(insert_slb(sK3,pair(sK5,bottom)),sK0(sK3,sK3,sK3),sK1(sK3,sK3,sK3))
    | ~ check_cpq(triple(insert_pqp(sK2,sK5),insert_slb(sK3,pair(sK5,bottom)),sK4))
    | less_than(sK1(sK3,sK3,sK3),sK0(sK3,sK3,sK3)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l26_li4142)]) ).

cnf(g10,plain,
    ( ~ pair_in_list(sK3,sK0(sK3,sK3,sK3),sK1(sK3,sK3,sK3))
    | pair_in_list(insert_slb(sK3,pair(sK5,bottom)),sK0(sK3,sK3,sK3),sK1(sK3,sK3,sK3)) ),
    inference(ground_cnf,[],[file('Axioms/SWV007+2.ax',ax23)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SWV390+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.14  % Command  : satcop --statistics %s
% 0.14/0.35  % Computer : n029.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Tue Jun 14 21:58:56 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.36  % symbols: 35
% 0.21/0.36  % clauses: 84
% 0.21/0.36  % start clauses: 2
% 0.21/0.36  % iterative deepening steps: 99
% 0.21/0.36  % maximum path limit: 3
% 0.21/0.36  % literal attempts: 5906
% 0.21/0.36  % depth failures: 4296
% 0.21/0.36  % regularity failures: 194
% 0.21/0.36  % tautology failures: 142
% 0.21/0.36  % reductions: 33
% 0.21/0.36  % extensions: 5728
% 0.21/0.36  % SAT variables: 2816
% 0.21/0.36  % SAT clauses: 2941
% 0.21/0.36  % WalkSAT solutions: 2937
% 0.21/0.36  % CDCL solutions: 0
% 0.21/0.36  % SZS status Theorem for theBenchmark
% 0.21/0.36  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------