↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : NUM854+1 : 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 : n019.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 2.83s 1.57s
% Output   : CNFRefutation 2.83s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f4ERROR: Could not build tree for root c_616ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f67,plain,
    ! [X0,X1,X2] :
      ( ~ greater(X1,X2)
      | greater(vmul(X1,X0),vmul(X2,X0)) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f108,plain,
    ~ greater(vmul(vd508,vd511),vmul(vd509,vd511)),
    inference(cnf_transformation,[],[f61]) ).

fof(f110,plain,
    greater(vd508,vd509),
    inference(cnf_transformation,[],[f4]) ).

fof(f116,plain,
    ! [X2,X0,X1] :
      ( ~ greater(X1,X2)
      | greater(vmul(X1,X0),vmul(X2,X0)) ),
    inference(cnf_transformation,[],[f67]) ).

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

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

tcf(c_51,plain,
    greater(vd508,vd509),
    inference(cnf_transformation,[],[f110]) ).

tcf(c_56,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( greater(vmul(X0,X2),vmul(X1,X2))
      | ~ greater(X0,X1) ),
    inference(cnf_transformation,[],[f116]) ).

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

tcf(c_151,plain,
    ~ greater(vmul(vd508,vd511),vmul(vd511,vd509)),
    inference(demodulation,[status(thm)],[c_49,c_59]) ).

tcf(c_169,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( greater(vmul(X0,X2),vmul(X2,X1))
      | ~ greater(X0,X1) ),
    inference(superposition,[status(thm)],[c_59,c_56]) ).

tcf(c_615,plain,
    ~ greater(vd508,vd509),
    inference(superposition,[status(thm)],[c_169,c_151]) ).

tcf(c_616,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_51,c_615]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM854+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.62  % Computer : n019.cluster.edu
% 0.14/0.62  % Model    : x86_64 x86_64
% 0.14/0.62  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.62  % Memory   : 8046.5625MB
% 0.14/0.62  % OS       : Linux 6.8.0-71-generic
% 0.14/0.62  % CPULimit : 300
% 0.14/0.62  % WCLimit  : 300
% 0.14/0.62  % DateTime : Thu Sep 24 05:34:50 UTC 2026
% 0.14/0.62  % CPUTime  : 
% 0.14/0.62  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.67  Running first-order theorem proving
% 0.18/0.67  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.18/0.68  
% 0.18/0.68  % ======== iProver multi-core TPTP/SMT =========
% 0.18/0.68  
% 0.18/0.69  % Detected problem language: tptp
% 0.18/0.70  % Proving...
% 2.83/1.57  % SZS status Started for theBenchmark.p
% 2.83/1.57  % SZS status Theorem for theBenchmark.p
% 2.83/1.57  
% 2.83/1.57  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.83/1.57  
% 2.83/1.57  % ------  iProver source info
% 2.83/1.57  
% 2.83/1.57  % git: date: 2026-07-19 20:42:38 +0200
% 2.83/1.57  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.83/1.57  % git: non_committed_changes: false
% 2.83/1.57  
% 2.83/1.57  % ------ Parsing...
% 2.83/1.57  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 2.83/1.57  % ------ Proving...
% 2.83/1.57  % ------ Problem Properties 
% 2.83/1.57  
% 2.83/1.57  % 
% 2.83/1.57  % clauses                               66
% 2.83/1.57  % conjectures                           1
% 2.83/1.57  % EPR                                   21
% 2.83/1.57  % Horn                                  61
% 2.83/1.57  % unary                                 29
% 2.83/1.57  % binary                                25
% 2.83/1.57  % lits                                  115
% 2.83/1.57  % lits eq                               38
% 2.83/1.57  % fd_pure                               0
% 2.83/1.57  % fd_pseudo                             0
% 2.83/1.57  % fd_cond                               0
% 2.83/1.57  % fd_pseudo_cond                        8
% 2.83/1.57  % AC symbols                            2
% 2.83/1.57  
% 2.83/1.57  % ------ Input Options Time Limit: Unbounded
% 2.83/1.57  
% 2.83/1.57  
% 2.83/1.57  % ------ 
% 2.83/1.57  % Current options:
% 2.83/1.57  % ------ 
% 2.83/1.57  
% 2.83/1.57  
% 2.83/1.57  % 
% 2.83/1.57  
% 2.83/1.57  % ------ Proving...
% 2.83/1.57  % 
% 2.83/1.57  
% 2.83/1.57  % SZS status Theorem for theBenchmark.p
% 2.83/1.57  
% 2.83/1.57  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.83/1.57  
% 2.83/1.57  
%------------------------------------------------------------------------------