↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n005.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:09:22 PM UTC 2026

% Result   : Unsatisfiable 4.85s 7.26s
% Output   : CNFRefutation 4.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   43 (  26 unt;   0 def)
%            Number of atoms       :  101 (   7 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :  118 (  60   ~;  58   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   4 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  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   4 con; 0-2 aty)
%            Number of variables   :   34 (   0 sgn  34   !;   0   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f27,axiom,
    ! [X0] : ssList(skaf68(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause27) ).

fof(f28,axiom,
    ! [X0] : ssList(skaf67(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause28) ).

fof(f29,axiom,
    ! [X0] : ssList(skaf66(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause29) ).

fof(f30,axiom,
    ! [X0] : ssItem(skaf65(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause30) ).

fof(f31,axiom,
    ! [X0] : ssItem(skaf64(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause31) ).

fof(f91,axiom,
    ! [X0] :
      ( totalorderedP(X0)
      | ~ ssList(X0)
      | ~ leq(skaf64(X0),skaf65(X0)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause91) ).

fof(f106,axiom,
    ! [X0,X1] :
      ( leq(X0,X1)
      | ~ ssItem(X0)
      | ~ ssItem(X1)
      | ~ lt(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause103) ).

fof(f177,axiom,
    ! [X0] :
      ( app(app(skaf66(X0),cons(skaf64(X0),skaf67(X0))),cons(skaf65(X0),skaf68(X0))) = X0
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause164) ).

fof(f195,axiom,
    ! [X2,X3,X0,X1,X4,X5] :
      ( lt(X1,X3)
      | ~ ssList(X5)
      | ~ strictorderedP(X5)
      | ~ ssItem(X1)
      | ~ ssItem(X3)
      | ~ ssList(X0)
      | ~ ssList(X2)
      | ~ ssList(X4)
      | app(app(X0,cons(X1,X2)),cons(X3,X4)) != X5 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause181) ).

fof(f202,negated_conjecture,
    ssList(sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).

fof(f204,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).

fof(f205,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).

fof(f206,negated_conjecture,
    segmentP(sk4,sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    strictorderedP(sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

fof(f211,plain,
    ( ~ totalorderedP(sk3)
    | ~ segmentP(sk4,sk3) ),
    inference(definition_unfolding,[],[f208,f204,f205,f205]) ).

fof(f231,plain,
    ! [X2,X3,X0,X1,X4] :
      ( lt(X1,X3)
      | ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4)))
      | ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
      | ~ ssItem(X1)
      | ~ ssItem(X3)
      | ~ ssList(X0)
      | ~ ssList(X2)
      | ~ ssList(X4) ),
    inference(equality_resolution,[],[f195]) ).

tcf(c_269,plain,
    ! [X0: $i] : ssList(skaf68(X0)),
    inference(cnf_transformation,[],[f27]) ).

tcf(c_270,plain,
    ! [X0: $i] : ssList(skaf67(X0)),
    inference(cnf_transformation,[],[f28]) ).

tcf(c_271,plain,
    ! [X0: $i] : ssList(skaf66(X0)),
    inference(cnf_transformation,[],[f29]) ).

tcf(c_272,plain,
    ! [X0: $i] : ssItem(skaf65(X0)),
    inference(cnf_transformation,[],[f30]) ).

tcf(c_273,plain,
    ! [X0: $i] : ssItem(skaf64(X0)),
    inference(cnf_transformation,[],[f31]) ).

tcf(c_333,plain,
    ! [X0: $i] :
      ( totalorderedP(X0)
      | ~ ssList(X0)
      | ~ leq(skaf64(X0),skaf65(X0)) ),
    inference(cnf_transformation,[],[f91]) ).

tcf(c_345,plain,
    ! [X0: $i,X1: $i] :
      ( leq(X0,X1)
      | ~ ssItem(X1)
      | ~ ssItem(X0)
      | ~ lt(X0,X1) ),
    inference(cnf_transformation,[],[f106]) ).

tcf(c_406,plain,
    ! [X0: $i] :
      ( totalorderedP(X0)
      | ( app(app(skaf66(X0),cons(skaf64(X0),skaf67(X0))),cons(skaf65(X0),skaf68(X0))) = X0 )
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f177]) ).

tcf(c_423,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( lt(X1,X3)
      | ~ ssItem(X3)
      | ~ ssItem(X1)
      | ~ ssList(X4)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
      | ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4))) ),
    inference(cnf_transformation,[],[f231]) ).

tcf(c_430,negated_conjecture,
    ssList(sk3),
    inference(cnf_transformation,[],[f202]) ).

tcf(c_432,negated_conjecture,
    segmentP(sk4,sk3),
    inference(cnf_transformation,[],[f206]) ).

tcf(c_433,negated_conjecture,
    strictorderedP(sk3),
    inference(cnf_transformation,[],[f207]) ).

tcf(c_434,negated_conjecture,
    ( ~ totalorderedP(sk3)
    | ~ segmentP(sk4,sk3) ),
    inference(cnf_transformation,[],[f211]) ).

tcf(c_548,negated_conjecture,
    ~ totalorderedP(sk3),
    inference(global_subsumption_just,[status(thm)],[c_434,c_432,c_434]) ).

tcf(c_6424,negated_conjecture,
    ~ totalorderedP(sk3),
    inference(demodulation,[status(thm)],[c_548]) ).

tcf(c_6425,negated_conjecture,
    strictorderedP(sk3),
    inference(demodulation,[status(thm)],[c_433]) ).

tcf(c_6428,negated_conjecture,
    ssList(sk3),
    inference(demodulation,[status(thm)],[c_430]) ).

tcf(c_9894,plain,
    ( totalorderedP(sk3)
    | ~ ssList(sk3)
    | ~ leq(skaf64(sk3),skaf65(sk3)) ),
    inference(instantiation,[status(thm)],[c_333]) ).

tcf(c_17359,plain,
    ( totalorderedP(sk3)
    | ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3 ) ),
    inference(superposition,[status(thm)],[c_6428,c_406]) ).

tcf(c_17394,plain,
    app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3,
    inference(forward_subsumption_resolution,[status(thm)],[c_17359,c_6424]) ).

tcf(c_22484,plain,
    ( lt(skaf64(sk3),skaf65(sk3))
    | ~ ssList(sk3)
    | ~ ssItem(skaf64(sk3))
    | ~ ssItem(skaf65(sk3))
    | ~ ssList(skaf66(sk3))
    | ~ ssList(skaf67(sk3))
    | ~ ssList(skaf68(sk3))
    | ~ strictorderedP(app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3)))) ),
    inference(superposition,[status(thm)],[c_17394,c_423]) ).

tcf(c_22537,plain,
    ( lt(skaf64(sk3),skaf65(sk3))
    | ~ strictorderedP(sk3)
    | ~ ssList(sk3)
    | ~ ssItem(skaf64(sk3))
    | ~ ssItem(skaf65(sk3))
    | ~ ssList(skaf66(sk3))
    | ~ ssList(skaf67(sk3))
    | ~ ssList(skaf68(sk3)) ),
    inference(light_normalisation,[status(thm)],[c_22484,c_17394]) ).

tcf(c_22538,plain,
    lt(skaf64(sk3),skaf65(sk3)),
    inference(forward_subsumption_resolution,[status(thm)],[c_22537,c_6425,c_6428,c_273,c_272,c_271,c_270,c_269]) ).

tcf(c_23284,plain,
    ( leq(skaf64(sk3),skaf65(sk3))
    | ~ ssItem(skaf64(sk3))
    | ~ ssItem(skaf65(sk3)) ),
    inference(superposition,[status(thm)],[c_22538,c_345]) ).

tcf(c_23285,plain,
    leq(skaf64(sk3),skaf65(sk3)),
    inference(forward_subsumption_resolution,[status(thm)],[c_23284,c_273,c_272]) ).

tcf(c_23292,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_23285,c_9894,c_434,c_432,c_430]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC340-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/5.35  % Computer : n005.cluster.edu
% 0.08/5.35  % Model    : x86_64 x86_64
% 0.08/5.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.35  % Memory   : 8046.5625MB
% 0.08/5.35  % OS       : Linux 6.8.0-71-generic
% 0.08/5.35  % CPULimit : 300
% 0.08/5.35  % WCLimit  : 300
% 0.08/5.35  % DateTime : Thu Sep 24 17:43:22 UTC 2026
% 0.08/5.36  % CPUTime  : 
% 0.08/5.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/5.39  Running first-order theorem proving
% 0.08/5.39  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/5.40  
% 0.13/5.40  % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.40  
% 0.13/5.40  % Detected problem language: tptp
% 0.13/5.41  % Proving...
% 4.85/7.26  % SZS status Started for theBenchmark.p
% 4.85/7.26  % SZS status Unsatisfiable for theBenchmark.p
% 4.85/7.26  
% 4.85/7.26  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.85/7.26  
% 4.85/7.26  % ------  iProver source info
% 4.85/7.26  
% 4.85/7.26  % git: date: 2026-07-19 20:42:38 +0200
% 4.85/7.26  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.85/7.26  % git: non_committed_changes: false
% 4.85/7.26  
% 4.85/7.26  % ------ Parsing...% successful
% 4.85/7.26  
% 4.85/7.26  
% 4.85/7.26  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 4.85/7.26  
% 4.85/7.26  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 4.85/7.26  
% 4.85/7.26  % ------ Preprocessing... gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 4.85/7.26  
% 4.85/7.26  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 4.85/7.26  % ------ Proving...
% 4.85/7.26  % ------ Problem Properties 
% 4.85/7.26  
% 4.85/7.26  % 
% 4.85/7.26  % clauses                               182
% 4.85/7.26  % conjectures                           5
% 4.85/7.26  % EPR                                   57
% 4.85/7.26  % Horn                                  154
% 4.85/7.26  % unary                                 63
% 4.85/7.26  % binary                                21
% 4.85/7.26  % lits                                  546
% 4.85/7.26  % lits eq                               69
% 4.85/7.26  % fd_pure                               0
% 4.85/7.26  % fd_pseudo                             0
% 4.85/7.26  % fd_cond                               15
% 4.85/7.26  % fd_pseudo_cond                        14
% 4.85/7.26  % AC symbols                            0
% 4.85/7.26  
% 4.85/7.26  % ------ Schedule dynamic 5 is on 
% 4.85/7.26  
% 4.85/7.26  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.85/7.26  
% 4.85/7.26  
% 4.85/7.26  % ------ 
% 4.85/7.26  % Current options:
% 4.85/7.26  % ------ 
% 4.85/7.26  
% 4.85/7.26  
% 4.85/7.26  % 
% 4.85/7.26  
% 4.85/7.26  % ------ Proving...
% 4.85/7.26  % 
% 4.85/7.26  
% 4.85/7.26  % SZS status Unsatisfiable for theBenchmark.p
% 4.85/7.26  
% 4.85/7.26  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.85/7.26  
% 4.85/7.26  
%------------------------------------------------------------------------------