↑ Up

SATCoP---0.1.THM-Prf.s

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

% Computer : n002.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:50 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    sPE(h(sK0),sK0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_15)]) ).

cnf(g1,plain,
    ~ sPE(sK0,'0'),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_15)]) ).

cnf(g2,plain,
    ( ~ sPE(h(sK0),sK0)
    | sPE(sK0,h(sK0)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g3,plain,
    ( ~ sPE(sK0,h(sK0))
    | ~ sPE(h(sK0),sK0)
    | sPE(sK0,sK0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    ( ~ sPE('0',sK0)
    | sPE(sK0,'0') ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g5,plain,
    ( ~ sPE(sK0,h(sK0))
    | ~ sPE(sK0,sK0)
    | sPE('==>'(sK0,sK0),'==>'(h(sK0),sK0)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    ( ~ sPE(h(sK0),sK0)
    | ~ sPE(h(sK0),sK0)
    | ~ '>='(h(sK0),h(sK0))
    | '>='(sK0,sK0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g7,plain,
    '>='(h(sK0),h(sK0)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05)]) ).

cnf(g8,plain,
    ( ~ '>='('0',sK0)
    | ~ '>='(sK0,'0')
    | sPE('0',sK0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07)]) ).

cnf(g9,plain,
    sPE(h(sK0),'==>'(h(sK0),sK0)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_14)]) ).

cnf(g10,plain,
    '>='(sK0,'0'),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09)]) ).

cnf(g11,plain,
    ( ~ sPE('==>'(sK0,sK0),'==>'(h(sK0),sK0))
    | ~ sPE('==>'(h(sK0),sK0),sK0)
    | sPE('==>'(sK0,sK0),sK0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ sPE('==>'(h(sK0),sK0),h(sK0))
    | ~ sPE(h(sK0),sK0)
    | sPE('==>'(h(sK0),sK0),sK0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    ( ~ sPE(h(sK0),'==>'(h(sK0),sK0))
    | sPE('==>'(h(sK0),sK0),h(sK0)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    sPE('+'(sK0,'0'),sK0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03)]) ).

cnf(g15,plain,
    ( ~ '>='('0','==>'(sK0,'+'(sK0,'0')))
    | ~ '>='('==>'(sK0,'+'(sK0,'0')),sK0)
    | '>='('0',sK0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06)]) ).

cnf(g16,plain,
    ( ~ '>='('+'(sK0,'0'),'+'(sK0,'0'))
    | '>='('0','==>'(sK0,'+'(sK0,'0'))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08)]) ).

cnf(g17,plain,
    ( ~ '>='(sK0,sK0)
    | '>='('+'(sK0,'0'),'+'(sK0,'0')) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_10)]) ).

cnf(g18,plain,
    ( ~ '>='(sK0,sK0)
    | '>='('==>'(sK0,'+'(sK0,'0')),'==>'(sK0,'+'(sK0,'0'))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_11)]) ).

cnf(g19,plain,
    sPE('==>'(sK0,'+'(sK0,'0')),'==>'(sK0,'+'(sK0,'0'))),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g20,plain,
    ( ~ sPE('==>'(sK0,'+'(sK0,'0')),'==>'(sK0,'+'(sK0,'0')))
    | ~ sPE('==>'(sK0,'+'(sK0,'0')),sK0)
    | ~ '>='('==>'(sK0,'+'(sK0,'0')),'==>'(sK0,'+'(sK0,'0')))
    | '>='('==>'(sK0,'+'(sK0,'0')),sK0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g21,plain,
    ( ~ sPE('==>'(sK0,'+'(sK0,'0')),'==>'(sK0,sK0))
    | ~ sPE('==>'(sK0,sK0),sK0)
    | sPE('==>'(sK0,'+'(sK0,'0')),sK0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g22,plain,
    ( ~ sPE(sK0,sK0)
    | ~ sPE('+'(sK0,'0'),sK0)
    | sPE('==>'(sK0,'+'(sK0,'0')),'==>'(sK0,sK0)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL893+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.04  % Command  : satcop --statistics %s
% 0.11/0.37  % Computer : n002.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 : Sun Sep  6 00:28:36 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.40  % symbols: 9
% 0.11/0.40  % clauses: 24
% 0.11/0.40  % start clauses: 2
% 0.11/0.40  % iterative deepening steps: 138
% 0.11/0.40  % maximum path limit: 4
% 0.11/0.40  % literal attempts: 29697
% 0.11/0.40  % depth failures: 23335
% 0.11/0.40  % regularity failures: 710
% 0.11/0.40  % tautology failures: 1222
% 0.11/0.40  % reductions: 249
% 0.11/0.40  % extensions: 29274
% 0.11/0.40  % SAT variables: 5132
% 0.11/0.40  % SAT clauses: 7090
% 0.11/0.40  % WalkSAT solutions: 7081
% 0.11/0.40  % CDCL solutions: 6
% 0.11/0.40  % SZS status Theorem for theBenchmark
% 0.11/0.40  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------