↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWV002-1 : TPTP v9.3.1. Released v1.0.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 03:16:11 PM UTC 2026

% Result   : Unsatisfiable 0.90s 1.27s
% Output   : CNFRefutation 0.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   35 (  24 unt;   3 def)
%            Number of atoms       :   75 (   9 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   43 (  24   ~;  19   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   4 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :   16 (   0 sgn  16   !;   0   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,axiom,
    ! [X2,X0,X1] :
      ( ~ less_than(X2,X1)
      | ~ less_than(X0,X2)
      | less_than(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',transitivity_of_less_than) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( X0 = X1
      | less_than(X1,X0)
      | less_than(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',all_related) ).

fof(f9,axiom,
    ! [X0] : ~ less_than(X0,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',x_not_less_than_x) ).

fof(f19,negated_conjecture,
    less_than(a(j),a(k)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

fof(f20,negated_conjecture,
    ! [X0] :
      ( ~ less_than(a(X0),a(k))
      | ~ less_than(X0,j)
      | less_than(X0,i) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

fof(f23,negated_conjecture,
    ~ less_than(q,i),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).

fof(f24,negated_conjecture,
    ~ less_than(j,q),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).

fof(f25,negated_conjecture,
    less_than(a(q),a(j)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).

tcf(c_78,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( less_than(X0,X2)
      | ~ less_than(X1,X2)
      | ~ less_than(X0,X1) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_79,plain,
    ! [X0: $i,X1: $i] :
      ( less_than(X1,X0)
      | less_than(X0,X1)
      | ( X0 = X1 ) ),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_80,plain,
    ! [X0: $i] : ~ less_than(X0,X0),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_86,negated_conjecture,
    less_than(a(j),a(k)),
    inference(cnf_transformation,[],[f19]) ).

tcf(c_87,negated_conjecture,
    ! [X0: $i] :
      ( less_than(X0,i)
      | ~ less_than(X0,j)
      | ~ less_than(a(X0),a(k)) ),
    inference(cnf_transformation,[],[f20]) ).

tcf(c_90,negated_conjecture,
    ~ less_than(q,i),
    inference(cnf_transformation,[],[f23]) ).

tcf(c_91,negated_conjecture,
    ~ less_than(j,q),
    inference(cnf_transformation,[],[f24]) ).

tcf(c_92,negated_conjecture,
    less_than(a(q),a(j)),
    inference(cnf_transformation,[],[f25]) ).

tcf(c_222,definition,
    iPr_def_10 = a(q),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_223,definition,
    iPr_def_11 = a(j),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_226,definition,
    iPr_def_14 = a(k),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_227,negated_conjecture,
    less_than(iPr_def_10,iPr_def_11),
    inference(demodulation,[status(thm)],[c_92,c_223,c_222]) ).

tcf(c_228,negated_conjecture,
    ~ less_than(j,q),
    inference(demodulation,[status(thm)],[c_91]) ).

tcf(c_229,negated_conjecture,
    ~ less_than(q,i),
    inference(demodulation,[status(thm)],[c_90]) ).

tcf(c_232,negated_conjecture,
    ! [X0: $i] :
      ( less_than(X0,i)
      | ~ less_than(X0,j)
      | ~ less_than(a(X0),iPr_def_14) ),
    inference(demodulation,[status(thm)],[c_87,c_226]) ).

tcf(c_233,negated_conjecture,
    less_than(iPr_def_11,iPr_def_14),
    inference(demodulation,[status(thm)],[c_86]) ).

tcf(c_624,plain,
    ( less_than(q,i)
    | ~ less_than(iPr_def_10,iPr_def_14)
    | ~ less_than(q,j) ),
    inference(superposition,[status(thm)],[c_222,c_232]) ).

tcf(c_626,plain,
    ( ~ less_than(iPr_def_10,iPr_def_14)
    | ~ less_than(q,j) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_624,c_229]) ).

tcf(c_734,plain,
    ( less_than(q,j)
    | ( j = q ) ),
    inference(superposition,[status(thm)],[c_79,c_228]) ).

tcf(c_967,plain,
    ! [X0: $i] :
      ( less_than(iPr_def_10,X0)
      | ~ less_than(iPr_def_11,X0) ),
    inference(superposition,[status(thm)],[c_227,c_78]) ).

tcf(c_1102,plain,
    less_than(iPr_def_10,iPr_def_14),
    inference(superposition,[status(thm)],[c_233,c_967]) ).

tcf(c_1106,plain,
    ~ less_than(q,j),
    inference(backward_subsumption_resolution,[status(thm)],[c_626,c_1102]) ).

tcf(c_1107,plain,
    j = q,
    inference(backward_subsumption_resolution,[status(thm)],[c_734,c_1106]) ).

tcf(c_1110,plain,
    a(j) = iPr_def_10,
    inference(demodulation,[status(thm)],[c_222,c_1107]) ).

tcf(c_1116,plain,
    iPr_def_10 = iPr_def_11,
    inference(demodulation,[status(thm)],[c_223,c_1110]) ).

tcf(c_1121,plain,
    less_than(iPr_def_10,iPr_def_10),
    inference(demodulation,[status(thm)],[c_227,c_1116]) ).

tcf(c_1122,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1121,c_80]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.35  % Computer : n026.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Thu Sep 24 18:19:09 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.39  Running first-order theorem proving
% 0.07/0.39  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.07/0.40  
% 0.07/0.40  % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.40  
% 0.07/0.40  % Detected problem language: tptp
% 0.12/0.42  % Proving...
% 0.90/1.27  % SZS status Started for theBenchmark.p
% 0.90/1.27  % SZS status Unsatisfiable for theBenchmark.p
% 0.90/1.27  
% 0.90/1.27  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.90/1.27  
% 0.90/1.27  % ------  iProver source info
% 0.90/1.27  
% 0.90/1.27  % git: date: 2026-07-19 20:42:38 +0200
% 0.90/1.27  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.90/1.27  % git: non_committed_changes: false
% 0.90/1.27  
% 0.90/1.27  % ------ Parsing...% successful
% 0.90/1.27  
% 0.90/1.27  
% 0.90/1.27  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 0.90/1.27  
% 0.90/1.27  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 0.90/1.27  
% 0.90/1.27  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 0.90/1.27  
% 0.90/1.27  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 0.90/1.27  % ------ Proving...
% 0.90/1.27  % ------ Problem Properties 
% 0.90/1.27  
% 0.90/1.27  % 
% 0.90/1.27  % clauses                               26
% 0.90/1.27  % conjectures                           11
% 0.90/1.27  % EPR                                   12
% 0.90/1.27  % Horn                                  24
% 0.90/1.27  % unary                                 18
% 0.90/1.27  % binary                                3
% 0.90/1.27  % lits                                  40
% 0.90/1.27  % lits eq                               12
% 0.90/1.28  % fd_pure                               0
% 0.90/1.28  % fd_pseudo                             0
% 0.90/1.28  % fd_cond                               0
% 0.90/1.28  % fd_pseudo_cond                        3
% 0.90/1.28  % AC symbols                            0
% 0.90/1.28  
% 0.90/1.28  % ------ Schedule dynamic 5 is on 
% 0.90/1.28  
% 0.90/1.28  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.90/1.28  
% 0.90/1.28  
% 0.90/1.28  % ------ 
% 0.90/1.28  % Current options:
% 0.90/1.28  % ------ 
% 0.90/1.28  
% 0.90/1.28  
% 0.90/1.28  % 
% 0.90/1.28  
% 0.90/1.28  % ------ Proving...
% 0.90/1.28  % 
% 0.90/1.28  
% 0.90/1.28  % SZS status Unsatisfiable for theBenchmark.p
% 0.90/1.28  
% 0.90/1.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.90/1.28  
% 0.90/1.28  
%------------------------------------------------------------------------------