↑ Up

hopCoP---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : GRP168-2 : TPTP v9.0.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n024.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 : Thu Jul 24 06:27:02 PM UTC 2025

% Result   : Unsatisfiable 35.94s 4.84s
% Output   : CNFRefutation 35.94s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named prove_p01b)

% Comments : 
%------------------------------------------------------------------------------
cnf(16,plain,
    greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)),
    inference(cnf,[status(esa)],[prove_p01b]) ).

cnf(l0,plain,
    greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)),
    inference(instantiation,[status(thm)],[16]) ).

cnf(12,plain,
    multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
    inference(cnf,[status(esa)],[monotony_glb1]) ).

cnf(l4,plain,
    multiply(inverse(c),greatest_lower_bound(multiply(a,c),multiply(b,c))) = greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))),
    inference(instantiation,[status(thm)],[12]) ).

cnf(14,plain,
    multiply(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)),
    inference(cnf,[status(esa)],[monotony_glb2]) ).

cnf(l24,plain,
    multiply(greatest_lower_bound(a,b),c) = greatest_lower_bound(multiply(a,c),multiply(b,c)),
    inference(instantiation,[status(thm)],[14]) ).

cnf(15,plain,
    greatest_lower_bound(a,b) = a,
    inference(cnf,[status(esa)],[p01b_1]) ).

cnf(l28,plain,
    greatest_lower_bound(a,b) = a,
    inference(instantiation,[status(thm)],[15]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l4,l24,l28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : GRP168-2 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.03/0.12  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.33  % Computer : n024.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  : 300
% 0.12/0.33  % DateTime : Sun Jul 20 14:12:49 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 0.12/0.33  % launching worker at depth: 1
% 0.12/0.33  % launching worker at depth: 4
% 0.12/0.33  % launching worker at depth: 2
% 0.12/0.33  % launching worker at depth: 5
% 0.12/0.33  % launching worker at depth: 6
% 0.12/0.33  % launching worker at depth: 3
% 0.12/0.33  % launching worker at depth: 7
% 0.12/0.33  % launching worker at depth: 8
% 0.12/0.33  % launching worker at depth: 9
% 0.12/0.34  % launching worker at depth: 10
% 0.18/0.35  % launching worker at depth: 11
% 35.94/4.84  % SZS status Theorem for theBenchmark
% 35.94/4.84  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------