↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : NUM855+2 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n017.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 02:26:55 PM UTC 2026

% Result   : Theorem 4.17s 1.24s
% Output   : CNFRefutation 4.17s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f35ERROR: Could not build tree for root c_2358ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f87,plain,
    ! [X0,X1,X2] :
      ( ( ( ~ less(X0,X1)
          | ~ leq(X1,X2) )
        & ( ~ leq(X0,X1)
          | ~ less(X1,X2) ) )
      | less(X0,X2) ),
    inference(ennf_transformation,[],[f35]) ).

fof(f92,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | greater(X1,X0) ),
    inference(ennf_transformation,[],[f41]) ).

fof(f93,plain,
    ! [X0,X1] :
      ( ~ greater(X0,X1)
      | less(X1,X0) ),
    inference(ennf_transformation,[],[f42]) ).

fof(f101,plain,
    ! [X0,X1] :
      ( ( ~ leq(X1,X0)
        | X1 = X0
        | less(X1,X0) )
      & ( ( X0 != X1
          & ~ less(X1,X0) )
        | leq(X1,X0) ) ),
    inference(nnf_transformation,[],[f39]) ).

fof(f102,plain,
    ! [X0,X1] :
      ( ( ~ leq(X1,X0)
        | X1 = X0
        | less(X1,X0) )
      & ( ( X0 != X1
          & ~ less(X1,X0) )
        | leq(X1,X0) ) ),
    inference(flattening,[],[f101]) ).

fof(f112,plain,
    ~ greater(vmul(vd508,vd511),vmul(vd509,vd512)),
    inference(cnf_transformation,[],[f65]) ).

fof(f114,plain,
    greater(vmul(vd511,vd509),vmul(vd512,vd509)),
    inference(cnf_transformation,[],[f4]) ).

fof(f116,plain,
    greater(vmul(vd508,vd511),vmul(vd509,vd511)),
    inference(cnf_transformation,[],[f6]) ).

fof(f125,plain,
    ! [X2,X0,X1] : vmul(vmul(X0,X1),X2) = vmul(X0,vmul(X1,X2)),
    inference(cnf_transformation,[],[f15]) ).

fof(f127,plain,
    ! [X0,X1] : vmul(X0,X1) = vmul(X1,X0),
    inference(cnf_transformation,[],[f17]) ).

fof(f147,plain,
    ! [X2,X0,X1] :
      ( ~ less(X0,X1)
      | ~ leq(X1,X2)
      | less(X0,X2) ),
    inference(cnf_transformation,[],[f87]) ).

fof(f154,plain,
    ! [X0,X1] :
      ( ~ less(X1,X0)
      | leq(X1,X0) ),
    inference(cnf_transformation,[],[f102]) ).

fof(f158,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | greater(X1,X0) ),
    inference(cnf_transformation,[],[f92]) ).

fof(f159,plain,
    ! [X0,X1] :
      ( ~ greater(X0,X1)
      | less(X1,X0) ),
    inference(cnf_transformation,[],[f93]) ).

fof(f174,plain,
    ! [X0,X1] : vplus(X0,X1) = vplus(X1,X0),
    inference(cnf_transformation,[],[f55]) ).

fof(f177,plain,
    ! [X2,X0,X1] : vplus(vplus(X0,X1),X2) = vplus(X0,vplus(X1,X2)),
    inference(cnf_transformation,[],[f58]) ).

tcf(c_49,negated_conjecture,
    ~ greater(vmul(vd508,vd511),vmul(vd509,vd512)),
    inference(cnf_transformation,[],[f112]) ).

tcf(c_51,plain,
    greater(vmul(vd511,vd509),vmul(vd512,vd509)),
    inference(cnf_transformation,[],[f114]) ).

tcf(c_53,plain,
    greater(vmul(vd508,vd511),vmul(vd509,vd511)),
    inference(cnf_transformation,[],[f116]) ).

tcf(c_61,plain,
    ! [X0: $i,X1: $i,X2: $i] : vmul(vmul(X0,X1),X2) = vmul(X0,vmul(X1,X2)),
    inference(cnf_transformation,[],[f125]) ).

tcf(c_63,plain,
    ! [X0: $i,X1: $i] : vmul(X0,X1) = vmul(X1,X0),
    inference(cnf_transformation,[],[f127]) ).

tcf(c_83,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( less(X0,X2)
      | ~ leq(X1,X2)
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f147]) ).

tcf(c_87,plain,
    ! [X0: $i,X1: $i] :
      ( leq(X0,X1)
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f154]) ).

tcf(c_93,plain,
    ! [X0: $i,X1: $i] :
      ( greater(X1,X0)
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f158]) ).

tcf(c_94,plain,
    ! [X0: $i,X1: $i] :
      ( less(X1,X0)
      | ~ greater(X0,X1) ),
    inference(cnf_transformation,[],[f159]) ).

tcf(c_109,plain,
    ! [X0: $i,X1: $i] : vplus(X0,X1) = vplus(X1,X0),
    inference(cnf_transformation,[],[f174]) ).

tcf(c_111,plain,
    ! [X0: $i,X1: $i,X2: $i] : vplus(vplus(X0,X1),X2) = vplus(X0,vplus(X1,X2)),
    inference(cnf_transformation,[],[f177]) ).

tcf(c_148,negated_conjecture,
    ~ greater(vmul(vd511,vd508),vmul(vd509,vd512)),
    inference(theory_normalisation,[status(thm)],[c_49,c_111,c_109,c_61,c_63]) ).

tcf(c_149,plain,
    greater(vmul(vd509,vd511),vmul(vd509,vd512)),
    inference(theory_normalisation,[status(thm)],[c_51,c_111,c_109,c_61,c_63]) ).

tcf(c_150,plain,
    greater(vmul(vd511,vd508),vmul(vd509,vd511)),
    inference(theory_normalisation,[status(thm)],[c_53,c_111,c_109,c_61,c_63]) ).

tcf(c_1121,plain,
    ( greater(vmul(vd511,vd508),vmul(vd509,vd512))
    | ~ less(vmul(vd509,vd512),vmul(vd511,vd508)) ),
    inference(instantiation,[status(thm)],[c_93]) ).

tcf(c_1250,plain,
    ! [X0: $i,X1: $i] :
      ( less(X1,vmul(vd511,vd508))
      | ~ less(X1,X0)
      | ~ leq(X0,vmul(vd511,vd508)) ),
    inference(instantiation,[status(thm)],[c_83]) ).

tcf(c_1671,plain,
    less(vmul(vd509,vd512),vmul(vd509,vd511)),
    inference(superposition,[status(thm)],[c_149,c_94]) ).

tcf(c_1695,plain,
    less(vmul(vd509,vd511),vmul(vd511,vd508)),
    inference(superposition,[status(thm)],[c_150,c_94]) ).

tcf(c_1740,plain,
    leq(vmul(vd509,vd511),vmul(vd511,vd508)),
    inference(superposition,[status(thm)],[c_1695,c_87]) ).

tcf(c_2356,plain,
    ( less(vmul(vd509,vd512),vmul(vd511,vd508))
    | ~ leq(vmul(vd509,vd511),vmul(vd511,vd508))
    | ~ less(vmul(vd509,vd512),vmul(vd509,vd511)) ),
    inference(instantiation,[status(thm)],[c_1250]) ).

tcf(c_2358,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_2356,c_1740,c_1671,c_1121,c_148]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM855+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.38  % Computer : n017.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Thu Sep 24 05:30:46 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.43  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.44  
% 0.12/0.44  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.44  
% 0.12/0.44  % Detected problem language: tptp
% 0.12/0.45  % Proving...
% 4.17/1.24  % SZS status Started for theBenchmark.p
% 4.17/1.24  % SZS status Theorem for theBenchmark.p
% 4.17/1.24  
% 4.17/1.24  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.17/1.24  
% 4.17/1.24  % ------  iProver source info
% 4.17/1.24  
% 4.17/1.24  % git: date: 2026-07-19 20:42:38 +0200
% 4.17/1.24  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.17/1.24  % git: non_committed_changes: false
% 4.17/1.24  
% 4.17/1.24  % ------ Parsing...
% 4.17/1.24  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 4.17/1.24  
% 4.17/1.24  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 4.17/1.24  
% 4.17/1.24  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 4.17/1.24  
% 4.17/1.24  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 4.17/1.24  % ------ Proving...
% 4.17/1.24  % ------ Problem Properties 
% 4.17/1.24  
% 4.17/1.24  % 
% 4.17/1.24  % clauses                               58
% 4.17/1.24  % conjectures                           1
% 4.17/1.24  % EPR                                   21
% 4.17/1.24  % Horn                                  53
% 4.17/1.24  % unary                                 23
% 4.17/1.24  % binary                                23
% 4.17/1.24  % lits                                  105
% 4.17/1.24  % lits eq                               27
% 4.17/1.24  % fd_pure                               0
% 4.17/1.24  % fd_pseudo                             0
% 4.17/1.24  % fd_cond                               0
% 4.17/1.24  % fd_pseudo_cond                        6
% 4.17/1.24  % AC symbols                            2
% 4.17/1.24  
% 4.17/1.24  % ------ Input Options Time Limit: Unbounded
% 4.17/1.24  
% 4.17/1.24  
% 4.17/1.24  % ------ 
% 4.17/1.24  % Current options:
% 4.17/1.24  % ------ 
% 4.17/1.24  
% 4.17/1.24  
% 4.17/1.24  % 
% 4.17/1.24  
% 4.17/1.24  % ------ Proving...
% 4.17/1.24  % 
% 4.17/1.24  
% 4.17/1.24  % SZS status Theorem for theBenchmark.p
% 4.17/1.24  
% 4.17/1.24  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.17/1.24  
% 4.17/1.24  
%------------------------------------------------------------------------------