↑ Up

SATCoP---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : LCL045-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n002.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 01:03:04 PM UTC 2026

% Result   : Unsatisfiable 14.58s 2.29s
% Output   : Proof 14.58s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_46)]) ).

cnf(g1,plain,
    is_a_theorem(implies(not(a),implies(not(b),not(a)))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18)]) ).

cnf(g2,plain,
    is_a_theorem(implies(b,implies(not(b),not(a)))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3)]) ).

cnf(g3,plain,
    ( ~ is_a_theorem(implies(b,implies(not(b),not(a))))
    | ~ is_a_theorem(implies(implies(b,implies(not(b),not(a))),implies(implies(a,b),implies(a,implies(not(b),not(a))))))
    | is_a_theorem(implies(implies(a,b),implies(a,implies(not(b),not(a))))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).

cnf(g4,plain,
    is_a_theorem(implies(implies(b,implies(not(b),not(a))),implies(implies(a,b),implies(a,implies(not(b),not(a)))))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_22)]) ).

cnf(g5,plain,
    is_a_theorem(implies(implies(a,implies(not(b),not(a))),implies(implies(not(a),implies(not(b),not(a))),implies(not(b),not(a))))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_54)]) ).

cnf(g6,plain,
    ( ~ is_a_theorem(implies(not(a),implies(not(b),not(a))))
    | ~ is_a_theorem(implies(implies(not(a),implies(not(b),not(a))),implies(implies(a,b),implies(not(b),not(a)))))
    | is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).

cnf(g7,plain,
    ( ~ is_a_theorem(implies(implies(a,b),implies(implies(not(a),implies(not(b),not(a))),implies(not(b),not(a)))))
    | ~ is_a_theorem(implies(implies(implies(a,b),implies(implies(not(a),implies(not(b),not(a))),implies(not(b),not(a)))),implies(implies(not(a),implies(not(b),not(a))),implies(implies(a,b),implies(not(b),not(a))))))
    | is_a_theorem(implies(implies(not(a),implies(not(b),not(a))),implies(implies(a,b),implies(not(b),not(a))))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).

cnf(g8,plain,
    is_a_theorem(implies(implies(implies(a,b),implies(implies(not(a),implies(not(b),not(a))),implies(not(b),not(a)))),implies(implies(not(a),implies(not(b),not(a))),implies(implies(a,b),implies(not(b),not(a)))))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_21)]) ).

cnf(g9,plain,
    ( ~ is_a_theorem(implies(implies(a,b),implies(a,implies(not(b),not(a)))))
    | ~ is_a_theorem(implies(implies(implies(a,b),implies(a,implies(not(b),not(a)))),implies(implies(a,b),implies(implies(not(a),implies(not(b),not(a))),implies(not(b),not(a))))))
    | is_a_theorem(implies(implies(a,b),implies(implies(not(a),implies(not(b),not(a))),implies(not(b),not(a))))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).

cnf(g10,plain,
    ( ~ is_a_theorem(implies(implies(a,implies(not(b),not(a))),implies(implies(not(a),implies(not(b),not(a))),implies(not(b),not(a)))))
    | ~ is_a_theorem(implies(implies(implies(a,implies(not(b),not(a))),implies(implies(not(a),implies(not(b),not(a))),implies(not(b),not(a)))),implies(implies(implies(a,b),implies(a,implies(not(b),not(a)))),implies(implies(a,b),implies(implies(not(a),implies(not(b),not(a))),implies(not(b),not(a)))))))
    | is_a_theorem(implies(implies(implies(a,b),implies(a,implies(not(b),not(a)))),implies(implies(a,b),implies(implies(not(a),implies(not(b),not(a))),implies(not(b),not(a)))))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment)]) ).

cnf(g11,plain,
    is_a_theorem(implies(implies(implies(a,implies(not(b),not(a))),implies(implies(not(a),implies(not(b),not(a))),implies(not(b),not(a)))),implies(implies(implies(a,b),implies(a,implies(not(b),not(a)))),implies(implies(a,b),implies(implies(not(a),implies(not(b),not(a))),implies(not(b),not(a))))))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_22)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL045-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : satcop --statistics %s
% 0.08/0.35  % Computer : n002.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep  5 03:42:20 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 14.58/2.29  % symbols: 7
% 14.58/2.29  % clauses: 7
% 14.58/2.29  % start clauses: 1
% 14.58/2.29  % iterative deepening steps: 11753
% 14.58/2.29  % maximum path limit: 557
% 14.58/2.29  % literal attempts: 310477
% 14.58/2.29  % depth failures: 1268
% 14.58/2.29  % regularity failures: 14716
% 14.58/2.29  % tautology failures: 909
% 14.58/2.29  % reductions: 0
% 14.58/2.29  % extensions: 299066
% 14.58/2.29  % SAT variables: 259686
% 14.58/2.29  % SAT clauses: 288150
% 14.58/2.29  % WalkSAT solutions: 288147
% 14.58/2.29  % CDCL solutions: 0
% 14.58/2.29  % SZS status Unsatisfiable for theBenchmark
% 14.58/2.29  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------