↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n026.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:00:17 PM UTC 2026

% Result   : Unsatisfiable 3.68s 1.19s
% Output   : CNFRefutation 3.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   30 (  30 unt;   0 def)
%            Number of atoms       :   30 (  29 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    8 (   8   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    5 (   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    :    9 (   9 usr;   7 con; 0-3 aty)
%            Number of variables   :   58 (   0 sgn  58   !;   0   ?;  47   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X3,X0,X1,X4] : multiply(multiply(X0,X1,X2),X3,multiply(X0,X1,X4)) = multiply(X0,X1,multiply(X2,X3,X4)),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO001-0.ax',associativity) ).

fof(f2,axiom,
    ! [X0,X1] : multiply(X0,X1,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO001-0.ax',ternary_multiply_1) ).

fof(f3,axiom,
    ! [X0,X1] : multiply(X0,X0,X1) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO001-0.ax',ternary_multiply_2) ).

fof(f5,axiom,
    ! [X0,X1] : multiply(X0,X1,inverse(X1)) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO001-0.ax',right_inverse) ).

fof(f6,negated_conjecture,
    multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)) != b,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_single_axiom) ).

fof(f7,plain,
    b != multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)),
    inference(reorient_equations,[],[f6]) ).

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

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

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

tcf(c_59,plain,
    ! [X0: $i,X1: $i] : multiply(X0,X1,inverse(X1)) = X0,
    inference(cnf_transformation,[],[f5]) ).

tcf(c_60,negated_conjecture,
    multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)) != b,
    inference(cnf_transformation,[],[f7]) ).

tcf(c_77,plain,
    multiply(multiply(a,inverse(a),b),inverse(multiply(c,d,multiply(e,f,g))),multiply(d,multiply(g,f,e),c)) != b,
    inference(demodulation,[status(thm)],[c_60,c_55]) ).

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

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

tcf(c_132,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : multiply(X0,X1,multiply(X2,X3,inverse(X1))) = multiply(multiply(X0,X1,X2),X3,X0),
    inference(superposition,[status(thm)],[c_59,c_55]) ).

tcf(c_160,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(X0,X1,multiply(X2,X0,X1)) = multiply(X2,X0,X1),
    inference(superposition,[status(thm)],[c_56,c_124]) ).

tcf(c_262,plain,
    ! [X0: $i,X1: $i] : multiply(X0,inverse(X0),X1) = X1,
    inference(superposition,[status(thm)],[c_59,c_160]) ).

tcf(c_276,plain,
    multiply(b,inverse(multiply(c,d,multiply(e,f,g))),multiply(d,multiply(g,f,e),c)) != b,
    inference(demodulation,[status(thm)],[c_77,c_262]) ).

tcf(c_298,plain,
    ! [X0: $i] : inverse(inverse(X0)) = X0,
    inference(superposition,[status(thm)],[c_262,c_59]) ).

tcf(c_448,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(X0,X1,multiply(inverse(X1),X2,X1)) = multiply(X0,X2,X1),
    inference(superposition,[status(thm)],[c_59,c_129]) ).

tcf(c_895,plain,
    ! [X0: $i,X1: $i] : multiply(inverse(X0),X1,X0) = multiply(X1,X1,X0),
    inference(superposition,[status(thm)],[c_448,c_160]) ).

tcf(c_1242,plain,
    ! [X0: $i,X1: $i] : multiply(inverse(X0),X1,X0) = X1,
    inference(demodulation,[status(thm)],[c_895,c_57]) ).

tcf(c_1243,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(X0,X1,X2) = multiply(X0,X2,X1),
    inference(demodulation,[status(thm)],[c_448,c_1242]) ).

tcf(c_1244,plain,
    multiply(b,multiply(d,multiply(g,f,e),c),inverse(multiply(c,d,multiply(e,f,g)))) != b,
    inference(demodulation,[status(thm)],[c_276,c_1243]) ).

tcf(c_1256,plain,
    ! [X0: $i,X1: $i] : multiply(X0,X1,inverse(X0)) = X1,
    inference(superposition,[status(thm)],[c_298,c_1242]) ).

tcf(c_1328,plain,
    multiply(b,multiply(d,c,multiply(g,e,f)),inverse(multiply(c,d,multiply(e,f,g)))) != b,
    inference(demodulation,[status(thm)],[c_1244,c_1243]) ).

tcf(c_3263,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1,X1),X2,X0) = multiply(X0,X1,X2),
    inference(superposition,[status(thm)],[c_1256,c_132]) ).

tcf(c_3373,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(X0,X1,X2) = multiply(X1,X2,X0),
    inference(light_normalisation,[status(thm)],[c_3263,c_56]) ).

tcf(c_3393,plain,
    multiply(b,multiply(c,multiply(g,e,f),d),inverse(multiply(c,d,multiply(e,f,g)))) != b,
    inference(demodulation,[status(thm)],[c_1328,c_3373]) ).

tcf(c_4150,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_3393,c_59,c_1243,c_3373]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : BOO034-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37  % Computer : n026.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Fri Sep 25 06:39:10 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41  Running UEQ theorem proving
% 0.11/0.41  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.11/0.42  
% 0.11/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42  
% 0.11/0.42  % Detected problem language: tptp
% 0.11/0.44  % Proving...
% 3.68/1.19  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.68/1.19  % SZS status Started for theBenchmark.p
% 3.68/1.19  % SZS status Unsatisfiable for theBenchmark.p
% 3.68/1.19  
% 3.68/1.19  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.68/1.19  
% 3.68/1.19  % ------  iProver source info
% 3.68/1.19  
% 3.68/1.19  % git: date: 2026-07-19 20:42:38 +0200
% 3.68/1.19  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.68/1.19  % git: non_committed_changes: false
% 3.68/1.19  
% 3.68/1.19  % ------ Parsing...% successful
% 3.68/1.19  
% 3.68/1.19  
% 3.68/1.19  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.68/1.19  
% 3.68/1.19  % ------ Preprocessing... sup_sim: 1  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 3.68/1.19  
% 3.68/1.19  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.68/1.19  
% 3.68/1.19  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 3.68/1.19  % ------ Proving...
% 3.68/1.19  % ------ Problem Properties 
% 3.68/1.19  
% 3.68/1.19  % 
% 3.68/1.19  % clauses                               6
% 3.68/1.19  % conjectures                           0
% 3.68/1.19  % EPR                                   0
% 3.68/1.19  % Horn                                  6
% 3.68/1.19  % unary                                 6
% 3.68/1.19  % binary                                0
% 3.68/1.19  % lits                                  6
% 3.68/1.19  % lits eq                               6
% 3.68/1.19  % fd_pure                               0
% 3.68/1.19  % fd_pseudo                             0
% 3.68/1.19  % fd_cond                               0
% 3.68/1.19  % fd_pseudo_cond                        0
% 3.68/1.19  % AC symbols                            0
% 3.68/1.19  
% 3.68/1.19  % ------ Input Options Time Limit: Unbounded
% 3.68/1.19  
% 3.68/1.19  
% 3.68/1.19  % ------ 
% 3.68/1.19  % Current options:
% 3.68/1.19  % ------ 
% 3.68/1.19  
% 3.68/1.19  
% 3.68/1.19  % 
% 3.68/1.19  
% 3.68/1.19  % ------ Proving...
% 3.68/1.19  % 
% 3.68/1.19  
% 3.68/1.19  % SZS status Unsatisfiable for theBenchmark.p
% 3.68/1.19  
% 3.68/1.19  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.68/1.20  
% 3.68/1.20  
%------------------------------------------------------------------------------