↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n003.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:48 PM UTC 2026

% Result   : Unsatisfiable 2.19s 1.28s
% Output   : CNFRefutation 2.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   18 (  18 unt;   0 def)
%            Number of atoms       :   18 (  17 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   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    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   27 (   0 sgn  27   !;   0   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : multiply(identity,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).

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

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

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

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

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

tcf(c_59,plain,
    ! [X0: $i] : multiply(identity,X0) = X0,
    inference(cnf_transformation,[],[f1]) ).

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

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

tcf(c_62,plain,
    ! [X0: $i,X1: $i] : left_division(X0,multiply(X0,X1)) = X1,
    inference(cnf_transformation,[],[f4]) ).

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

tcf(c_68,negated_conjecture,
    multiply(multiply(a,multiply(b,c)),a) != multiply(multiply(a,b),multiply(c,a)),
    inference(cnf_transformation,[],[f12]) ).

tcf(c_98,plain,
    multiply(multiply(a,multiply(b,c)),a) != multiply(a,multiply(multiply(b,c),a)),
    inference(demodulation,[status(thm)],[c_68,c_67]) ).

tcf(c_190,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(X0,multiply(multiply(left_division(X0,X1),X2),X0)) = multiply(X1,multiply(X2,X0)),
    inference(superposition,[status(thm)],[c_61,c_67]) ).

tcf(c_279,plain,
    ! [X0: $i,X1: $i] : multiply(X0,multiply(left_division(X0,X1),X0)) = multiply(X1,multiply(identity,X0)),
    inference(superposition,[status(thm)],[c_60,c_190]) ).

tcf(c_295,plain,
    ! [X0: $i,X1: $i] : multiply(X0,multiply(left_division(X0,X1),X0)) = multiply(X1,X0),
    inference(light_normalisation,[status(thm)],[c_279,c_59]) ).

tcf(c_323,plain,
    ! [X0: $i,X1: $i] : multiply(multiply(X0,X1),X0) = multiply(X0,multiply(X1,X0)),
    inference(superposition,[status(thm)],[c_62,c_295]) ).

tcf(c_339,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_98,c_323]) ).


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