↑ Up

SATCoP---0.1.UNS-Prf.s

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

% Computer : n018.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:06 PM UTC 2026

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

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

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

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

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

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

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

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

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

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

cnf(g9,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(not(a),implies(a,b))))
    | is_a_theorem(implies(not(a),implies(a,b))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).

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

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

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

cnf(g13,plain,
    is_a_theorem(implies(implies(not(b),not(a)),implies(a,b))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_49)]) ).

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

cnf(g15,plain,
    is_a_theorem(implies(implies(not(a),implies(implies(not(b),not(a)),implies(a,b))),implies(implies(not(a),implies(not(b),not(a))),implies(not(a),implies(a,b))))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_35)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL066-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : satcop --statistics %s
% 0.08/0.35  % Computer : n018.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 : Fri Sep  4 21:03:33 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 2.78/0.70  % symbols: 7
% 2.78/0.70  % clauses: 5
% 2.78/0.70  % start clauses: 1
% 2.78/0.70  % iterative deepening steps: 2047
% 2.78/0.70  % maximum path limit: 29
% 2.78/0.70  % literal attempts: 67613
% 2.78/0.70  % depth failures: 3035
% 2.78/0.70  % regularity failures: 2928
% 2.78/0.70  % tautology failures: 608
% 2.78/0.70  % reductions: 0
% 2.78/0.70  % extensions: 65589
% 2.78/0.70  % SAT variables: 56951
% 2.78/0.70  % SAT clauses: 61672
% 2.78/0.70  % WalkSAT solutions: 61671
% 2.78/0.70  % CDCL solutions: 0
% 2.78/0.70  % SZS status Unsatisfiable for theBenchmark
% 2.78/0.70  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------