↑ Up

SATCoP---0.1.THM-Prf.s

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

% Computer : n017.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:04:00 PM UTC 2026

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

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

cnf(g1,plain,
    ( ~ is_a_theorem(strict_implies(and(sK78,sK79),sK78))
    | axiom_m2 ),
    inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',axiom_m2)]) ).

cnf(g2,plain,
    ( ~ sPE(necessarily(implies(and(sK78,sK79),sK78)),strict_implies(and(sK78,sK79),sK78))
    | ~ is_a_theorem(necessarily(implies(and(sK78,sK79),sK78)))
    | is_a_theorem(strict_implies(and(sK78,sK79),sK78)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g3,plain,
    ( ~ sPE(strict_implies(and(sK78,sK79),sK78),necessarily(implies(and(sK78,sK79),sK78)))
    | sPE(necessarily(implies(and(sK78,sK79),sK78)),strict_implies(and(sK78,sK79),sK78)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    ( ~ op_strict_implies
    | sPE(strict_implies(and(sK78,sK79),sK78),necessarily(implies(and(sK78,sK79),sK78))) ),
    inference(ground_cnf,[],[file('Axioms/LCL007+1.ax',op_strict_implies)]) ).

cnf(g5,plain,
    necessitation,
    inference(ground_cnf,[],[file('Axioms/LCL007+2.ax',km5_necessitation)]) ).

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

cnf(g7,plain,
    op_strict_implies,
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies)]) ).

cnf(g8,plain,
    ( ~ is_a_theorem(implies(and(sK78,sK79),sK78))
    | ~ necessitation
    | is_a_theorem(necessarily(implies(and(sK78,sK79),sK78))) ),
    inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',necessitation)]) ).

cnf(g9,plain,
    ( ~ and_1
    | is_a_theorem(implies(and(sK78,sK79),sK78)) ),
    inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',and_1)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL529+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04  % Command  : satcop --statistics %s
% 0.08/0.35  % Computer : n017.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 15:27:52 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.12/0.40  % symbols: 165
% 0.12/0.40  % clauses: 159
% 0.12/0.40  % start clauses: 1
% 0.12/0.40  % iterative deepening steps: 588
% 0.12/0.40  % maximum path limit: 5
% 0.12/0.40  % literal attempts: 51846
% 0.12/0.40  % depth failures: 35435
% 0.12/0.40  % regularity failures: 2585
% 0.12/0.40  % tautology failures: 1808
% 0.12/0.40  % reductions: 1
% 0.12/0.40  % extensions: 51272
% 0.12/0.40  % SAT variables: 22526
% 0.12/0.40  % SAT clauses: 24531
% 0.12/0.40  % WalkSAT solutions: 24529
% 0.12/0.40  % CDCL solutions: 0
% 0.12/0.40  % SZS status Theorem for theBenchmark
% 0.12/0.40  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------