TSTP Solution File: GRP148-1 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : GRP148-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n016.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:29 EDT 2022

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

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

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

cnf(g2,plain,
    sPE(least_upper_bound(a,c),c),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1c_1)]) ).

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

cnf(g4,plain,
    sPE(least_upper_bound(b,c),c),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1c_2)]) ).

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

cnf(g6,plain,
    sPE(greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(least_upper_bound(a,b),c)),least_upper_bound(a,b)),
    inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',glb_absorbtion)]) ).

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

cnf(g8,plain,
    ( ~ sPE(least_upper_bound(least_upper_bound(a,b),c),c)
    | sPE(c,least_upper_bound(least_upper_bound(a,b),c)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    ( ~ sPE(least_upper_bound(least_upper_bound(a,b),c),least_upper_bound(a,c))
    | ~ sPE(least_upper_bound(a,c),c)
    | sPE(least_upper_bound(least_upper_bound(a,b),c),c) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    ( ~ sPE(least_upper_bound(least_upper_bound(a,b),c),least_upper_bound(a,least_upper_bound(b,c)))
    | ~ sPE(least_upper_bound(a,least_upper_bound(b,c)),least_upper_bound(a,c))
    | sPE(least_upper_bound(least_upper_bound(a,b),c),least_upper_bound(a,c)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(least_upper_bound(a,least_upper_bound(b,c)),least_upper_bound(least_upper_bound(a,b),c))
    | sPE(least_upper_bound(least_upper_bound(a,b),c),least_upper_bound(a,least_upper_bound(b,c))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    sPE(least_upper_bound(a,least_upper_bound(b,c)),least_upper_bound(least_upper_bound(a,b),c)),
    inference(ground_cnf,[],[file('Axioms/GRP004-2.ax',associativity_of_lub)]) ).

cnf(g13,plain,
    ( ~ sPE(a,a)
    | ~ sPE(least_upper_bound(b,c),c)
    | sPE(least_upper_bound(a,least_upper_bound(b,c)),least_upper_bound(a,c)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : GRP148-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n016.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jun 13 06:16:44 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 11.61/1.79  % symbols: 10
% 11.61/1.79  % clauses: 25
% 11.61/1.79  % start clauses: 1
% 11.61/1.79  % iterative deepening steps: 8137
% 11.61/1.79  % maximum path limit: 8
% 11.61/1.79  % literal attempts: 1143042
% 11.61/1.79  % depth failures: 401788
% 11.61/1.79  % regularity failures: 132070
% 11.61/1.79  % tautology failures: 80704
% 11.61/1.79  % reductions: 0
% 11.61/1.79  % extensions: 1135048
% 11.61/1.79  % SAT variables: 378049
% 11.61/1.79  % SAT clauses: 601563
% 11.61/1.79  % WalkSAT solutions: 601564
% 11.61/1.79  % CDCL solutions: 0
% 11.61/1.79  % SZS status Unsatisfiable for theBenchmark
% 11.61/1.79  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------