↑ Up

SATCoP---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SWV406+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n023.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:55 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ( pair_in_list(sK0,sK1(sK0,sK0),sK2(sK0,sK0))
    | check_cpq(triple(sK0,sK0,sK0)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l42_co)]) ).

cnf(g1,plain,
    ( ~ less_than(sK2(sK0,sK0),sK1(sK0,sK0))
    | check_cpq(triple(sK0,sK0,sK0)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l42_co)]) ).

cnf(g2,plain,
    ( ~ check_cpq(triple(sK3,insert_slb(sK0,pair(sK5,sK6)),sK4))
    | pair_in_list(insert_slb(sK0,pair(sK5,sK6)),sK7,sK8) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l42_co)]) ).

cnf(g3,plain,
    ( ~ less_than(sK8,sK7)
    | ~ check_cpq(triple(sK3,insert_slb(sK0,pair(sK5,sK6)),sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l42_co)]) ).

cnf(g4,plain,
    ( ~ pair_in_list(insert_slb(sK0,pair(sK5,sK6)),sK7,sK8)
    | sPE(sK6,sK8)
    | pair_in_list(sK0,sK7,sK8) ),
    inference(ground_cnf,[],[file('Axioms/SWV007+2.ax',ax23)]) ).

cnf(g5,plain,
    ( ~ less_than(sK6,sK5)
    | ~ check_cpq(triple(sK3,sK0,sK4))
    | check_cpq(triple(sK3,insert_slb(sK0,pair(sK5,sK6)),sK4)) ),
    inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax37)]) ).

cnf(g6,plain,
    ( ~ pair_in_list(sK0,sK7,sK8)
    | ~ check_cpq(triple(sK0,sK0,sK0))
    | less_than(sK8,sK7) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l42_co)]) ).

cnf(g7,plain,
    ( ~ strictly_less_than(sK5,sK6)
    | ~ check_cpq(triple(sK3,insert_slb(sK0,pair(sK5,sK6)),sK4)) ),
    inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax38)]) ).

cnf(g8,plain,
    ( ~ pair_in_list(insert_slb(sK0,pair(sK5,sK6)),sK7,sK8)
    | sPE(sK5,sK7)
    | pair_in_list(sK0,sK7,sK8) ),
    inference(ground_cnf,[],[file('Axioms/SWV007+2.ax',ax23)]) ).

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

cnf(g10,plain,
    ( ~ pair_in_list(insert_slb(sK0,pair(sK5,sK6)),sK5,sK6)
    | less_than(sK6,sK5)
    | check_cpq(triple(sK3,insert_slb(sK0,pair(sK5,sK6)),sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l42_co)]) ).

cnf(g11,plain,
    ( ~ less_than(sK5,sK6)
    | less_than(sK6,sK5)
    | strictly_less_than(sK5,sK6) ),
    inference(ground_cnf,[],[file('Axioms/SWV007+0.ax',stricly_smaller_definition)]) ).

cnf(g12,plain,
    ( less_than(sK6,sK5)
    | less_than(sK5,sK6) ),
    inference(ground_cnf,[],[file('Axioms/SWV007+0.ax',totality)]) ).

cnf(g13,plain,
    sPE(sK6,sK6),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    ( ~ sPE(sK5,sK5)
    | ~ sPE(sK6,sK6)
    | pair_in_list(insert_slb(sK0,pair(sK5,sK6)),sK5,sK6) ),
    inference(ground_cnf,[],[file('Axioms/SWV007+2.ax',ax23)]) ).

cnf(g15,plain,
    sPE(sK5,sK5),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g16,plain,
    ( ~ less_than(sK6,sK5)
    | ~ check_cpq(triple(sK3,insert_slb(sK0,pair(sK5,sK6)),sK4))
    | check_cpq(triple(sK3,sK0,sK4)) ),
    inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax37)]) ).

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

cnf(g18,plain,
    ( ~ pair_in_list(insert_slb(sK0,pair(sK5,sK6)),sK1(sK3,sK4),sK2(sK3,sK4))
    | less_than(sK2(sK3,sK4),sK1(sK3,sK4))
    | check_cpq(triple(sK3,insert_slb(sK0,pair(sK5,sK6)),sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l42_co)]) ).

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

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

cnf(g21,plain,
    ( ~ sPE(sK6,sK8)
    | ~ sPE(sK5,sK7)
    | ~ less_than(sK6,sK5)
    | less_than(sK8,sK7) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV406+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : satcop --statistics %s
% 0.13/0.33  % Computer : n023.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % 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 : Wed Jun 15 10:00:35 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.40  % symbols: 38
% 0.20/0.40  % clauses: 85
% 0.20/0.40  % start clauses: 6
% 0.20/0.40  % iterative deepening steps: 208
% 0.20/0.40  % maximum path limit: 2
% 0.20/0.40  % literal attempts: 62897
% 0.20/0.40  % depth failures: 51232
% 0.20/0.40  % regularity failures: 1628
% 0.20/0.40  % tautology failures: 816
% 0.20/0.40  % reductions: 1183
% 0.20/0.40  % extensions: 60684
% 0.20/0.40  % SAT variables: 9176
% 0.20/0.40  % SAT clauses: 10246
% 0.20/0.40  % WalkSAT solutions: 10244
% 0.20/0.40  % CDCL solutions: 0
% 0.20/0.40  % SZS status Theorem for theBenchmark
% 0.20/0.40  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------