↑ Up

SATCoP---0.1.UNS-Prf.s

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

% Computer : n016.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:12 PM UTC 2026

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

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

cnf(g1,plain,
    is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(c,equivalent(a,c)),equivalent(c,equivalent(a,b))))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',yqm)]) ).

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

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

cnf(g4,plain,
    is_a_theorem(equivalent(equivalent(c,b),equivalent(equivalent(a,b),equivalent(a,c)))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',yqm)]) ).

cnf(g5,plain,
    is_a_theorem(equivalent(equivalent(equivalent(c,b),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',yqm)]) ).

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

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

cnf(g8,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(c,equivalent(a,c)),equivalent(c,equivalent(a,b)))),equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(c,equivalent(a,c)),equivalent(c,equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c)))))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',yqm)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL117-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : satcop --statistics %s
% 0.11/0.37  % Computer : n016.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Fri Sep  4 21:15:28 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  % symbols: 7
% 0.11/0.38  % clauses: 3
% 0.11/0.38  % start clauses: 1
% 0.11/0.38  % iterative deepening steps: 113
% 0.11/0.38  % maximum path limit: 5
% 0.11/0.38  % literal attempts: 1019
% 0.11/0.38  % depth failures: 235
% 0.11/0.38  % regularity failures: 0
% 0.11/0.38  % tautology failures: 7
% 0.11/0.38  % reductions: 0
% 0.11/0.38  % extensions: 908
% 0.11/0.38  % SAT variables: 780
% 0.11/0.38  % SAT clauses: 769
% 0.11/0.38  % WalkSAT solutions: 763
% 0.11/0.38  % CDCL solutions: 0
% 0.11/0.38  % SZS status Unsatisfiable for theBenchmark
% 0.11/0.38  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------