↑ Up

SATCoP---0.1.THM-Prf.s

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

% Computer : n028.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 : Thu Jul 21 11:48:37 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ big_p(sK2),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49)]) ).

cnf(g1,plain,
    ( ~ sPE(b,sK2)
    | ~ big_p(b)
    | big_p(sK2) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g2,plain,
    big_p(b),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49_3)]) ).

cnf(g3,plain,
    ( ~ sPE(sK2,b)
    | sPE(b,sK2) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    ( ~ sPE(a,sK2)
    | ~ big_p(a)
    | big_p(sK2) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g5,plain,
    big_p(a),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49_2)]) ).

cnf(g6,plain,
    ( ~ sPE(sK2,a)
    | sPE(a,sK2) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g7,plain,
    ( sPE(sK2,sK0)
    | sPE(sK2,sK1) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49_1)]) ).

cnf(g8,plain,
    ( sPE(b,sK0)
    | sPE(b,sK1) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49_1)]) ).

cnf(g9,plain,
    ( sPE(a,sK0)
    | sPE(a,sK1) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49_1)]) ).

cnf(g10,plain,
    ( ~ sPE(b,sK0)
    | sPE(sK0,b) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(b,sK1)
    | sPE(sK1,b) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ sPE(a,sK1)
    | sPE(sK1,a) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    ( ~ sPE(sK2,sK1)
    | ~ sPE(sK1,a)
    | sPE(sK2,a) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    ( ~ sPE(sK2,sK0)
    | ~ sPE(sK0,a)
    | sPE(sK2,a) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    ( ~ sPE(a,sK0)
    | sPE(sK0,a) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g16,plain,
    ( ~ sPE(sK2,sK1)
    | ~ sPE(sK1,b)
    | sPE(sK2,b) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g17,plain,
    ( ~ sPE(sK2,sK0)
    | ~ sPE(sK0,b)
    | sPE(sK2,b) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g18,plain,
    ( ~ sPE(a,sK1)
    | ~ sPE(sK1,b)
    | sPE(a,b) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g19,plain,
    ~ sPE(a,b),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49_4)]) ).

cnf(g20,plain,
    ( ~ sPE(a,sK0)
    | ~ sPE(sK0,b)
    | sPE(a,b) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN072+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n028.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 Jul 12 01:19:29 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % symbols: 8
% 0.13/0.35  % clauses: 9
% 0.13/0.35  % start clauses: 1
% 0.13/0.35  % iterative deepening steps: 200
% 0.13/0.35  % maximum path limit: 8
% 0.13/0.35  % literal attempts: 17351
% 0.13/0.35  % depth failures: 6190
% 0.13/0.35  % regularity failures: 2525
% 0.13/0.35  % tautology failures: 7306
% 0.13/0.35  % reductions: 1688
% 0.13/0.35  % extensions: 15513
% 0.13/0.35  % SAT variables: 206
% 0.13/0.35  % SAT clauses: 732
% 0.13/0.35  % WalkSAT solutions: 728
% 0.13/0.35  % CDCL solutions: 0
% 0.13/0.35  % SZS status Theorem for theBenchmark
% 0.13/0.35  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------