↑ Up

hopCoP---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : GRP152-1 : 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 : n027.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:26:59 PM UTC 2025

% Result   : Unsatisfiable 7.52s 1.28s
% Output   : CNFRefutation 7.52s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named prove_ax_lub3a)

% Comments : 
%------------------------------------------------------------------------------
cnf(15,plain,
    least_upper_bound(b,least_upper_bound(a,b)) != least_upper_bound(a,b),
    inference(cnf,[status(esa)],[prove_ax_lub3a]) ).

cnf(l0,plain,
    least_upper_bound(b,least_upper_bound(a,b)) != least_upper_bound(a,b),
    inference(instantiation,[status(thm)],[15]) ).

cnf(4,plain,
    least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
    inference(cnf,[status(esa)],[symmetry_of_lub]) ).

cnf(l7,plain,
    least_upper_bound(b,a) = least_upper_bound(a,b),
    inference(instantiation,[status(thm)],[4]) ).

cnf(6,plain,
    least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
    inference(cnf,[status(esa)],[associativity_of_lub]) ).

cnf(l10,plain,
    least_upper_bound(b,least_upper_bound(b,a)) = least_upper_bound(least_upper_bound(b,b),a),
    inference(instantiation,[status(thm)],[6]) ).

cnf(l9,plain,
    least_upper_bound(least_upper_bound(b,b),a) = least_upper_bound(a,least_upper_bound(b,b)),
    inference(instantiation,[status(thm)],[4]) ).

cnf(7,plain,
    least_upper_bound(X0,X0) = X0,
    inference(cnf,[status(esa)],[idempotence_of_lub]) ).

cnf(l12,plain,
    least_upper_bound(b,b) = b,
    inference(instantiation,[status(thm)],[7]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l7,l10,l9,l12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : GRP152-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.07/0.13  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.35  % Computer : n027.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Sun Jul 20 14:09:49 EDT 2025
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  % launching worker at depth: 1
% 0.13/0.35  % launching worker at depth: 5
% 0.13/0.35  % launching worker at depth: 6
% 0.13/0.35  % launching worker at depth: 4
% 0.13/0.35  % launching worker at depth: 7
% 0.13/0.35  % launching worker at depth: 3
% 0.13/0.35  % launching worker at depth: 8
% 0.13/0.35  % launching worker at depth: 2
% 0.13/0.35  % launching worker at depth: 9
% 0.13/0.35  % launching worker at depth: 10
% 0.20/0.39  % launching worker at depth: 11
% 7.52/1.28  % SZS status Theorem for theBenchmark
% 7.52/1.28  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------