↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : GRP195-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n018.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:47 PM UTC 2026

% Result   : Unsatisfiable 3.12s 1.25s
% Output   : CNFRefutation 3.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (  13 unt;   0 def)
%            Number of atoms       :   13 (  12 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    8 (   2 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    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn  26   !;   0   ?;  21   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP008-0.ax',associativity_of_multiply) ).

fof(f2,axiom,
    ! [X0,X1] : multiply(X0,multiply(X1,X1)) = multiply(X1,multiply(X1,X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condition) ).

fof(f3,negated_conjecture,
    multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))) != multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

tcf(c_52,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_53,plain,
    ! [X0: $i,X1: $i] : multiply(X0,multiply(X0,X1)) = multiply(X1,multiply(X0,X0)),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_54,negated_conjecture,
    multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))) != multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_96,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),multiply(X0,multiply(X1,X2))) = multiply(X2,multiply(multiply(X0,X1),multiply(X0,X1))),
    inference(superposition,[status(thm)],[c_52,c_53]) ).

tcf(c_100,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,multiply(X1,X1)),X2) = multiply(X1,multiply(multiply(X1,X0),X2)),
    inference(superposition,[status(thm)],[c_53,c_52]) ).

tcf(c_112,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(X0,multiply(X0,multiply(X1,X2))) = multiply(X1,multiply(X0,multiply(X0,X2))),
    inference(demodulation,[status(thm)],[c_100,c_52]) ).

tcf(c_135,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : multiply(X0,multiply(X0,multiply(X1,multiply(X2,multiply(X2,X3))))) = multiply(X2,multiply(X0,multiply(X0,multiply(X2,multiply(X1,X3))))),
    inference(superposition,[status(thm)],[c_112,c_112]) ).

tcf(c_341,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(X0,multiply(X1,multiply(X0,multiply(X1,X2)))) = multiply(X2,multiply(X0,multiply(X1,multiply(X0,X1)))),
    inference(demodulation,[status(thm)],[c_96,c_52]) ).

tcf(c_342,plain,
    multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))) != multiply(a,multiply(b,multiply(a,multiply(a,multiply(b,multiply(a,multiply(b,b))))))),
    inference(demodulation,[status(thm)],[c_54,c_341]) ).

tcf(c_343,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_342,c_135]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP195-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.34  % Computer : n018.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Wed Sep 23 14:09:17 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.37  Running UEQ theorem proving
% 0.13/0.37  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.39  
% 0.13/0.39  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.39  
% 0.13/0.39  % Detected problem language: tptp
% 0.13/0.40  % Proving...
% 3.12/1.25  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.12/1.25  % SZS status Started for theBenchmark.p
% 3.12/1.25  % SZS status Unsatisfiable for theBenchmark.p
% 3.12/1.25  
% 3.12/1.25  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.12/1.25  
% 3.12/1.25  % ------  iProver source info
% 3.12/1.25  
% 3.12/1.25  % git: date: 2026-07-19 20:42:38 +0200
% 3.12/1.25  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.12/1.25  % git: non_committed_changes: false
% 3.12/1.25  
% 3.12/1.25  % ------ Parsing...% successful
% 3.12/1.25  
% 3.12/1.25  
% 3.12/1.25  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.12/1.25  
% 3.12/1.25  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 3.12/1.25  
% 3.12/1.25  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.12/1.25  
% 3.12/1.25  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 3.12/1.25  % ------ Proving...
% 3.12/1.25  % ------ Problem Properties 
% 3.12/1.25  
% 3.12/1.25  % 
% 3.12/1.25  % clauses                               3
% 3.12/1.25  % conjectures                           1
% 3.12/1.25  % EPR                                   0
% 3.12/1.25  % Horn                                  3
% 3.12/1.25  % unary                                 3
% 3.12/1.25  % binary                                0
% 3.12/1.25  % lits                                  3
% 3.12/1.25  % lits eq                               3
% 3.12/1.25  % fd_pure                               0
% 3.12/1.25  % fd_pseudo                             0
% 3.12/1.25  % fd_cond                               0
% 3.12/1.25  % fd_pseudo_cond                        0
% 3.12/1.25  % AC symbols                            0
% 3.12/1.25  
% 3.12/1.25  % ------ Input Options Time Limit: Unbounded
% 3.12/1.25  
% 3.12/1.25  
% 3.12/1.25  % ------ 
% 3.12/1.25  % Current options:
% 3.12/1.25  % ------ 
% 3.12/1.25  
% 3.12/1.25  
% 3.12/1.25  % 
% 3.12/1.25  
% 3.12/1.25  % ------ Proving...
% 3.12/1.25  % 
% 3.12/1.25  
% 3.12/1.25  % SZS status Unsatisfiable for theBenchmark.p
% 3.12/1.25  
% 3.12/1.25  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.12/1.25  
% 3.12/1.25  
%------------------------------------------------------------------------------