↑ Up

SATCoP---0.1.THM-Prf.s

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

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 07:06:27 PM UTC 2026

% Result   : Theorem 273.70s 35.69s
% Output   : Proof 274.50s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    sPE(index(cons(arr(a,arr(a,b)),nil),zero),just(arr(a,arr(a,b)))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_025)]) ).

cnf(g1,plain,
    sPE(arr(a,b),arr(a,b)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g2,plain,
    sPE(a,a),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g3,plain,
    ( ~ sPE(a,a)
    | ~ sPE(arr(a,b),arr(a,b))
    | sPE(arr(a,arr(a,b)),arr(a,arr(a,b))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    sPE(index(cons(a,cons(arr(a,arr(a,b)),nil)),zero),just(a)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_025)]) ).

cnf(g5,plain,
    sPE(cons(a,cons(arr(a,arr(a,b)),nil)),cons(a,cons(arr(a,arr(a,b)),nil))),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    ( ~ sPE(a,a)
    | ~ sPE(index(cons(a,cons(arr(a,arr(a,b)),nil)),zero),just(a))
    | tc(cons(a,cons(arr(a,arr(a,b)),nil)),var(zero),a) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_031)]) ).

cnf(g7,plain,
    ( ~ sPE(index(cons(a,cons(arr(a,arr(a,b)),nil)),suc(zero)),index(cons(arr(a,arr(a,b)),nil),zero))
    | ~ sPE(index(cons(arr(a,arr(a,b)),nil),zero),just(arr(a,arr(a,b))))
    | sPE(index(cons(a,cons(arr(a,arr(a,b)),nil)),suc(zero)),just(arr(a,arr(a,b)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    sPE(index(cons(a,cons(arr(a,arr(a,b)),nil)),suc(zero)),index(cons(arr(a,arr(a,b)),nil),zero)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_026)]) ).

cnf(g9,plain,
    sPE(proj1Just(just(zero)),zero),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_014)]) ).

cnf(g10,plain,
    ( ~ sPE(zero,proj1Just(just(zero)))
    | sPE(var(zero),var(proj1Just(just(zero)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(proj1Just(just(zero)),zero)
    | sPE(zero,proj1Just(just(zero))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ sPE(arr(a,arr(a,b)),arr(a,arr(a,b)))
    | ~ sPE(index(cons(a,cons(arr(a,arr(a,b)),nil)),suc(zero)),just(arr(a,arr(a,b))))
    | tc(cons(a,cons(arr(a,arr(a,b)),nil)),var(suc(zero)),arr(a,arr(a,b))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_031)]) ).

cnf(g13,plain,
    ( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),var(suc(zero)),arr(a,arr(a,b)))
    | ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),var(zero),a)
    | tc(cons(a,cons(arr(a,arr(a,b)),nil)),app(var(suc(zero)),var(zero),a),arr(a,b)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_027)]) ).

cnf(g14,plain,
    ~ tc(nil,lam(lam(app(app(var(suc(zero)),var(zero),a),var(proj1Just(just(zero))),a))),arr(arr(a,arr(a,b)),arr(a,b))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_032)]) ).

cnf(g15,plain,
    ( ~ tc(cons(arr(a,arr(a,b)),nil),lam(app(app(var(suc(zero)),var(zero),a),var(proj1Just(just(zero))),a)),arr(a,b))
    | tc(nil,lam(lam(app(app(var(suc(zero)),var(zero),a),var(proj1Just(just(zero))),a))),arr(arr(a,arr(a,b)),arr(a,b))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_029)]) ).

cnf(g16,plain,
    ( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),app(app(var(suc(zero)),var(zero),a),var(proj1Just(just(zero))),a),b)
    | tc(cons(arr(a,arr(a,b)),nil),lam(app(app(var(suc(zero)),var(zero),a),var(proj1Just(just(zero))),a)),arr(a,b)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_029)]) ).

cnf(g17,plain,
    ( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),app(var(suc(zero)),var(zero),a),arr(a,b))
    | ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),var(proj1Just(just(zero))),a)
    | tc(cons(a,cons(arr(a,arr(a,b)),nil)),app(app(var(suc(zero)),var(zero),a),var(proj1Just(just(zero))),a),b) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_027)]) ).

cnf(g18,plain,
    ( ~ sPE(cons(a,cons(arr(a,arr(a,b)),nil)),cons(a,cons(arr(a,arr(a,b)),nil)))
    | ~ sPE(var(zero),var(proj1Just(just(zero))))
    | ~ sPE(a,a)
    | ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),var(zero),a)
    | tc(cons(a,cons(arr(a,arr(a,b)),nil)),var(proj1Just(just(zero))),a) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWX224+1 : TPTP v9.3.0. Released v9.3.0.
% 0.11/0.13  % Command  : satcop --statistics %s
% 0.16/0.34  % Computer : n015.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Tue May  5 12:39:46 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 273.70/35.69  % symbols: 28
% 273.70/35.69  % clauses: 59
% 273.70/35.69  % start clauses: 1
% 273.70/35.69  % iterative deepening steps: 26663
% 273.70/35.69  % maximum path limit: 7
% 273.70/35.69  % literal attempts: 31330005
% 273.70/35.69  % depth failures: 20542273
% 273.70/35.69  % regularity failures: 2096842
% 273.70/35.69  % tautology failures: 301351
% 273.70/35.69  % reductions: 0
% 273.70/35.69  % extensions: 31328710
% 273.70/35.69  % SAT variables: 11980934
% 273.70/35.69  % SAT clauses: 16651853
% 273.70/35.69  % WalkSAT solutions: 16651852
% 273.70/35.69  % CDCL solutions: 0
% 273.70/35.69  % SZS status Theorem for theBenchmark
% 273.70/35.69  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------