↑ Up

SATCoP---0.1.THM-Prf.s

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

% Computer : n006.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 04:57:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ sPE(intersection(difference(sK3,sK4),sK4),empty_set),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_intersection_difference_empty_set)]) ).

cnf(g1,plain,
    ( sPE(intersection(difference(sK3,sK4),sK4),empty_set)
    | member(sK2(intersection(difference(sK3,sK4),sK4),empty_set),intersection(difference(sK3,sK4),sK4))
    | sP0(intersection(difference(sK3,sK4),sK4),empty_set) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn)]) ).

cnf(g2,plain,
    ( member(sK2(intersection(difference(sK3,sK4),sK4),empty_set),empty_set)
    | ~ sP0(intersection(difference(sK3,sK4),sK4),empty_set) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn)]) ).

cnf(g3,plain,
    ~ member(sK2(intersection(difference(sK3,sK4),sK4),empty_set),empty_set),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn)]) ).

cnf(g4,plain,
    ( ~ member(sK2(intersection(difference(sK3,sK4),sK4),empty_set),intersection(difference(sK3,sK4),sK4))
    | member(sK2(intersection(difference(sK3,sK4),sK4),empty_set),difference(sK3,sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn)]) ).

cnf(g5,plain,
    ( ~ member(sK2(intersection(difference(sK3,sK4),sK4),empty_set),sK4)
    | ~ member(sK2(intersection(difference(sK3,sK4),sK4),empty_set),difference(sK3,sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn)]) ).

cnf(g6,plain,
    ( ~ sPE(intersection(sK4,difference(sK3,sK4)),intersection(difference(sK3,sK4),sK4))
    | ~ member(sK2(intersection(difference(sK3,sK4),sK4),empty_set),intersection(difference(sK3,sK4),sK4))
    | member(sK2(intersection(difference(sK3,sK4),sK4),empty_set),intersection(sK4,difference(sK3,sK4))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn)]) ).

cnf(g7,plain,
    sPE(intersection(sK4,difference(sK3,sK4)),intersection(difference(sK3,sK4),sK4)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection)]) ).

cnf(g8,plain,
    ( ~ member(sK2(intersection(difference(sK3,sK4),sK4),empty_set),intersection(sK4,difference(sK3,sK4)))
    | member(sK2(intersection(difference(sK3,sK4),sK4),empty_set),sK4) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem  : SET008+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.15  % Command  : satcop --statistics %s
% 0.14/0.37  % Computer : n006.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit : 300
% 0.14/0.37  % WCLimit  : 600
% 0.14/0.37  % DateTime : Mon Jul 11 01:53:05 EDT 2022
% 0.14/0.37  % CPUTime  : 
% 0.14/0.38  % symbols: 14
% 0.14/0.38  % clauses: 36
% 0.14/0.38  % start clauses: 1
% 0.14/0.38  % iterative deepening steps: 71
% 0.14/0.38  % maximum path limit: 3
% 0.14/0.38  % literal attempts: 2874
% 0.14/0.38  % depth failures: 2066
% 0.14/0.38  % regularity failures: 170
% 0.14/0.38  % tautology failures: 80
% 0.14/0.38  % reductions: 50
% 0.14/0.38  % extensions: 2781
% 0.14/0.38  % SAT variables: 1102
% 0.14/0.38  % SAT clauses: 1518
% 0.14/0.38  % WalkSAT solutions: 1511
% 0.14/0.38  % CDCL solutions: 0
% 0.14/0.38  % SZS status Theorem for theBenchmark
% 0.14/0.38  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------