↑ Up

SATCoP---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : GRP145-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n026.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  : 600s
% DateTime : Sat Jul 16 11:32:28 EDT 2022

% Result   : Unsatisfiable 0.19s 0.36s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ sPE(greatest_lower_bound(greatest_lower_bound(a,b),b),greatest_lower_bound(a,b)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_glb3b)]) ).

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

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

cnf(g3,plain,
    sPE(greatest_lower_bound(a,greatest_lower_bound(b,b)),greatest_lower_bound(greatest_lower_bound(a,b),b)),
    inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',associativity_of_glb)]) ).

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

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

cnf(g6,plain,
    ( ~ sPE(greatest_lower_bound(b,b),b)
    | sPE(b,greatest_lower_bound(b,b)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g7,plain,
    sPE(greatest_lower_bound(b,b),b),
    inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',idempotence_of_gld)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12  % Problem  : GRP145-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.13/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n026.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jun 14 14:31:06 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.36  % symbols: 9
% 0.19/0.36  % clauses: 23
% 0.19/0.36  % start clauses: 1
% 0.19/0.36  % iterative deepening steps: 337
% 0.19/0.36  % maximum path limit: 5
% 0.19/0.36  % literal attempts: 17026
% 0.19/0.36  % depth failures: 6998
% 0.19/0.36  % regularity failures: 1791
% 0.19/0.36  % tautology failures: 1058
% 0.19/0.36  % reductions: 0
% 0.19/0.36  % extensions: 16821
% 0.19/0.36  % SAT variables: 4955
% 0.19/0.36  % SAT clauses: 7760
% 0.19/0.36  % WalkSAT solutions: 7761
% 0.19/0.36  % CDCL solutions: 0
% 0.19/0.36  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.36  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------