↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : GRP159-1 : TPTP v9.2.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n023.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 04:24:36 PM UTC 2026

% Result   : Unsatisfiable 1.22s 1.71s
% Output   : CNFRefutation 1.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   17 (  17 unt;   0 nHn;   8 RR)
%            Number of literals    :   17 (  16 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   20 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(lub_absorbtion,axiom,
    least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).

cnf(symmetry_of_glb,axiom,
    greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).

cnf(ax_mono2c_1,hypothesis,
    greatest_lower_bound(a,b) = a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_mono2c_1) ).

cnf(prove_ax_mono2c,negated_conjecture,
    least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_mono2c) ).

cnf(monotony_lub1,axiom,
    multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).

cnf(symmetry_of_lub,axiom,
    least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).

cnf(c_0_6,axiom,
    least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
    lub_absorbtion ).

cnf(c_0_7,axiom,
    greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
    symmetry_of_glb ).

cnf(c_0_8,plain,
    least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,hypothesis,
    greatest_lower_bound(a,b) = a,
    ax_mono2c_1 ).

cnf(c_0_10,negated_conjecture,
    least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
    prove_ax_mono2c ).

cnf(c_0_11,axiom,
    multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
    monotony_lub1 ).

cnf(c_0_12,hypothesis,
    least_upper_bound(b,a) = b,
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,axiom,
    least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
    symmetry_of_lub ).

cnf(c_0_14,negated_conjecture,
    multiply(c,least_upper_bound(a,b)) != multiply(c,b),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,hypothesis,
    least_upper_bound(a,b) = b,
    inference(rw,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : GRP159-1 : TPTP v9.2.1. Bugfixed v1.2.1.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32  % Computer : n023.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Mon May  4 18:26:38 EDT 2026
% 0.15/0.32  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.22/1.71  % Version  : CSE_E---1.7
% 1.22/1.71  % Problem  : theBenchmark.p
% 1.22/1.71  % SZS status Unsatisfiable for theBenchmark.p
% 1.22/1.71  % SZS output start CNFRefutation
% See solution above
% 1.22/1.71  % Total time : 1.369s
%------------------------------------------------------------------------------