↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : GRP155-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 01:31:35 PM UTC 2026

% Result   : Unsatisfiable 2.54s 6.52s
% Output   : CNFRefutation 2.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   19 (  19 unt;   0 def)
%            Number of atoms       :   19 (  18 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            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   :   26 (   0 sgn  26   !;   0   ?;  13   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).

fof(f6,axiom,
    ! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).

fof(f7,axiom,
    ! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).

fof(f8,axiom,
    ! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).

fof(f16,axiom,
    ! [X2,X0,X1] : multiply(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).

fof(f17,axiom,
    greatest_lower_bound(a,b) = a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_mono1b) ).

fof(f18,plain,
    a = greatest_lower_bound(a,b),
    inference(reorient_equations,[],[f17]) ).

fof(f19,negated_conjecture,
    greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_mono1b) ).

fof(f20,plain,
    multiply(a,c) != greatest_lower_bound(multiply(a,c),multiply(b,c)),
    inference(reorient_equations,[],[f19]) ).

tcf(c_69,plain,
    ! [X0: $i,X1: $i] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_70,plain,
    ! [X0: $i,X1: $i] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_71,plain,
    ! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(X0,greatest_lower_bound(X1,X2)),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_72,plain,
    ! [X0: $i,X1: $i,X2: $i] : least_upper_bound(least_upper_bound(X0,X1),X2) = least_upper_bound(X0,least_upper_bound(X1,X2)),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_80,plain,
    ! [X0: $i,X1: $i,X2: $i] : greatest_lower_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(greatest_lower_bound(X0,X2),X1),
    inference(cnf_transformation,[],[f16]) ).

tcf(c_81,plain,
    greatest_lower_bound(a,b) = a,
    inference(cnf_transformation,[],[f18]) ).

tcf(c_82,negated_conjecture,
    greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
    inference(cnf_transformation,[],[f20]) ).

tcf(c_132,plain,
    multiply(greatest_lower_bound(a,b),c) != multiply(a,c),
    inference(ac_demodulation,[status(thm)],[c_82,c_80,c_71,c_69,c_72,c_70]) ).

tcf(c_134,plain,
    multiply(a,c) != multiply(a,c),
    inference(light_normalisation,[status(thm)],[c_132,c_81]) ).

tcf(c_135,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_134]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP155-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.60  % Computer : n011.cluster.edu
% 0.14/5.60  % Model    : x86_64 x86_64
% 0.14/5.60  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.60  % Memory   : 8046.5625MB
% 0.14/5.60  % OS       : Linux 6.8.0-71-generic
% 0.14/5.60  % CPULimit : 300
% 0.14/5.60  % WCLimit  : 300
% 0.14/5.60  % DateTime : Wed Sep 23 13:53:03 UTC 2026
% 0.14/5.60  % CPUTime  : 
% 0.14/5.60  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.64  Running UEQ theorem proving
% 0.14/5.64  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/5.65  
% 0.14/5.65  % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.65  
% 0.14/5.65  % Detected problem language: tptp
% 0.14/5.67  % Proving...
% 2.54/6.52  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.54/6.52  % SZS status Started for theBenchmark.p
% 2.54/6.52  % SZS status Unsatisfiable for theBenchmark.p
% 2.54/6.52  
% 2.54/6.52  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.54/6.52  
% 2.54/6.52  % ------  iProver source info
% 2.54/6.52  
% 2.54/6.52  % git: date: 2026-07-19 20:42:38 +0200
% 2.54/6.52  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.54/6.52  % git: non_committed_changes: false
% 2.54/6.52  
% 2.54/6.52  % ------ Parsing...% successful
% 2.54/6.52  
% 2.54/6.52  
% 2.54/6.52  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.54/6.52  
% 2.54/6.52  % ------ Preprocessing...% 
% 2.54/6.52  
% 2.54/6.52  % SZS status Unsatisfiable for theBenchmark.p
% 2.54/6.52  
% 2.54/6.52  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.54/6.53  
% 2.54/6.53  
%------------------------------------------------------------------------------