↑ Up

SATCoP---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : LCL465+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n013.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:55 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ implies_3,
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_3)]) ).

cnf(g1,plain,
    ( ~ is_a_theorem(implies(implies(sK10,sK11),implies(implies(sK11,sK12),implies(sK10,sK12))))
    | implies_3 ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',implies_3)]) ).

cnf(g2,plain,
    ( ~ cn1
    | is_a_theorem(implies(implies(sK10,sK11),implies(implies(sK11,sK12),implies(sK10,sK12)))) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',cn1)]) ).

cnf(g3,plain,
    cn1,
    inference(ground_cnf,[],[file('Axioms/LCL006+3.ax',luka_cn1)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL465+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03  % Command  : satcop --statistics %s
% 0.08/0.35  % Computer : n013.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:20:19 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  % symbols: 95
% 0.08/0.35  % clauses: 81
% 0.08/0.35  % start clauses: 1
% 0.08/0.35  % iterative deepening steps: 30
% 0.08/0.35  % maximum path limit: 2
% 0.08/0.35  % literal attempts: 177
% 0.08/0.35  % depth failures: 97
% 0.08/0.35  % regularity failures: 15
% 0.08/0.35  % tautology failures: 2
% 0.08/0.35  % reductions: 0
% 0.08/0.35  % extensions: 148
% 0.08/0.35  % SAT variables: 145
% 0.08/0.35  % SAT clauses: 120
% 0.08/0.35  % WalkSAT solutions: 114
% 0.08/0.35  % CDCL solutions: 0
% 0.08/0.35  % SZS status Theorem for theBenchmark
% 0.08/0.35  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------