TSTP Solution File: GRP185-3 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : GRP185-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n005.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 Aug 31 00:58:34 EDT 2023

% Result   : Unsatisfiable 4.42s 1.20s
% Output   : CNFRefutation 4.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   17 (  17 unt;   0 nHn;   6 RR)
%            Number of literals    :   17 (  16 equ;   5 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 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   :   29 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
    greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != least_upper_bound(multiply(a,b),identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p22b) ).

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

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

cnf(c_52,plain,
    greatest_lower_bound(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(X0,greatest_lower_bound(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).

cnf(c_53,plain,
    least_upper_bound(least_upper_bound(X0,X1),X2) = least_upper_bound(X0,least_upper_bound(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).

cnf(c_57,plain,
    greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).

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

cnf(c_60,plain,
    least_upper_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(least_upper_bound(X0,X2),X1),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).

cnf(c_62,plain,
    multiply(identity,X0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).

cnf(c_80,negated_conjecture,
    greatest_lower_bound(least_upper_bound(identity,multiply(a,b)),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != least_upper_bound(identity,multiply(a,b)),
    inference(theory_normalisation,[status(thm)],[c_49,c_52,c_50,c_53,c_51]) ).

cnf(c_113,plain,
    greatest_lower_bound(least_upper_bound(identity,multiply(a,b)),least_upper_bound(least_upper_bound(multiply(a,b),multiply(a,identity)),least_upper_bound(b,identity))) != least_upper_bound(identity,multiply(a,b)),
    inference(demodulation,[status(thm)],[c_80,c_58,c_60,c_62]) ).

cnf(c_186,plain,
    least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X1,least_upper_bound(X0,X2)),
    inference(superposition,[status(thm)],[c_53,c_51]) ).

cnf(c_576,plain,
    greatest_lower_bound(X0,least_upper_bound(X1,least_upper_bound(X0,X2))) = X0,
    inference(superposition,[status(thm)],[c_186,c_57]) ).

cnf(c_671,plain,
    greatest_lower_bound(least_upper_bound(identity,multiply(a,b)),least_upper_bound(b,least_upper_bound(identity,least_upper_bound(multiply(a,b),multiply(a,identity))))) != least_upper_bound(identity,multiply(a,b)),
    inference(theory_normalisation,[status(thm)],[c_113,c_53,c_51,c_52,c_50]) ).

cnf(c_1444,plain,
    greatest_lower_bound(least_upper_bound(X0,X1),least_upper_bound(X2,least_upper_bound(X0,least_upper_bound(X1,X3)))) = least_upper_bound(X0,X1),
    inference(superposition,[status(thm)],[c_53,c_576]) ).

cnf(c_2662,plain,
    least_upper_bound(identity,multiply(a,b)) != least_upper_bound(identity,multiply(a,b)),
    inference(demodulation,[status(thm)],[c_671,c_1444]) ).

cnf(c_2663,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_2662]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GRP185-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.10/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n005.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  : 300
% 0.13/0.34  % DateTime : Mon Aug 28 19:59:53 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.47  Running UEQ theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.42/1.20  % SZS status Started for theBenchmark.p
% 4.42/1.20  % SZS status Unsatisfiable for theBenchmark.p
% 4.42/1.20  
% 4.42/1.20  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.42/1.20  
% 4.42/1.20  ------  iProver source info
% 4.42/1.20  
% 4.42/1.20  git: date: 2023-05-31 18:12:56 +0000
% 4.42/1.20  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.42/1.20  git: non_committed_changes: false
% 4.42/1.20  git: last_make_outside_of_git: false
% 4.42/1.20  
% 4.42/1.20  ------ Parsing...successful
% 4.42/1.20  
% 4.42/1.20  
% 4.42/1.20  
% 4.42/1.20  ------ Preprocessing... sup_sim: 1  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 4.42/1.20  
% 4.42/1.20  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 4.42/1.20  
% 4.42/1.20  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 4.42/1.20  ------ Proving...
% 4.42/1.20  ------ Problem Properties 
% 4.42/1.20  
% 4.42/1.20  
% 4.42/1.20  clauses                                 16
% 4.42/1.20  conjectures                             0
% 4.42/1.20  EPR                                     0
% 4.42/1.20  Horn                                    16
% 4.42/1.20  unary                                   16
% 4.42/1.20  binary                                  0
% 4.42/1.20  lits                                    16
% 4.42/1.20  lits eq                                 16
% 4.42/1.20  fd_pure                                 0
% 4.42/1.20  fd_pseudo                               0
% 4.42/1.20  fd_cond                                 0
% 4.42/1.20  fd_pseudo_cond                          0
% 4.42/1.20  AC symbols                              2
% 4.42/1.20  
% 4.42/1.20  ------ Input Options Time Limit: Unbounded
% 4.42/1.20  
% 4.42/1.20  
% 4.42/1.20  ------ 
% 4.42/1.20  Current options:
% 4.42/1.20  ------ 
% 4.42/1.20  
% 4.42/1.20  
% 4.42/1.20  
% 4.42/1.20  
% 4.42/1.20  ------ Proving...
% 4.42/1.20  
% 4.42/1.20  
% 4.42/1.20  % SZS status Unsatisfiable for theBenchmark.p
% 4.42/1.20  
% 4.42/1.20  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.42/1.20  
% 4.42/1.20  
%------------------------------------------------------------------------------