↑ Up

SATCoP---0.1.THM-Prf.s

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

% Computer : n001.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:54 PM UTC 2026

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

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

cnf(g1,plain,
    ( ~ is_a_theorem(implies(sK32,and(sK32,sK32)))
    | kn1 ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',kn1)]) ).

cnf(g2,plain,
    ( ~ and_3
    | is_a_theorem(implies(sK32,implies(sK32,and(sK32,sK32)))) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',and_3)]) ).

cnf(g3,plain,
    ( ~ modus_ponens
    | ~ is_a_theorem(implies(sK32,implies(sK32,and(sK32,sK32))))
    | ~ is_a_theorem(implies(implies(sK32,implies(sK32,and(sK32,sK32))),implies(sK32,and(sK32,sK32))))
    | is_a_theorem(implies(sK32,and(sK32,sK32))) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).

cnf(g4,plain,
    ( ~ implies_2
    | is_a_theorem(implies(implies(sK32,implies(sK32,and(sK32,sK32))),implies(sK32,and(sK32,sK32)))) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',implies_2)]) ).

cnf(g5,plain,
    and_3,
    inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_and_3)]) ).

cnf(g6,plain,
    implies_2,
    inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_implies_2)]) ).

cnf(g7,plain,
    modus_ponens,
    inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_modus_ponens)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL459+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04  % Command  : satcop --statistics %s
% 0.11/0.36  % Computer : n001.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Fri Sep  4 14:34:29 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.38  % symbols: 94
% 0.11/0.38  % clauses: 91
% 0.11/0.38  % start clauses: 1
% 0.11/0.38  % iterative deepening steps: 87
% 0.11/0.38  % maximum path limit: 4
% 0.11/0.38  % literal attempts: 2552
% 0.11/0.38  % depth failures: 1795
% 0.11/0.38  % regularity failures: 128
% 0.11/0.38  % tautology failures: 96
% 0.11/0.38  % reductions: 0
% 0.11/0.38  % extensions: 2477
% 0.11/0.38  % SAT variables: 1842
% 0.11/0.38  % SAT clauses: 1860
% 0.11/0.38  % WalkSAT solutions: 1856
% 0.11/0.38  % CDCL solutions: 0
% 0.11/0.38  % SZS status Theorem for theBenchmark
% 0.11/0.38  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------