↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWC007-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 : n011.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:07:29 PM UTC 2026

% Result   : Unsatisfiable 1.08s 6.29s
% Output   : CNFRefutation 1.08s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f291ERROR: Could not build tree for root c_10897ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f73,axiom,
    ! [X0] :
      ( app(X0,nil) = X0
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).

fof(f74,axiom,
    ! [X0] :
      ( app(nil,X0) = X0
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).

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

fof(f203,negated_conjecture,
    ssList(sk4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).

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

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

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

fof(f207,negated_conjecture,
    ! [X2,X0,X1] :
      ( app(X0,X2) != sk1
      | app(app(X0,X1),X2) != sk2
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f228,plain,
    ! [X0] :
      ( app(X0,sk3) = X0
      | ~ ssList(X0) ),
    inference(definition_unfolding,[],[f73,f204]) ).

fof(f229,plain,
    ! [X0] :
      ( app(sk3,X0) = X0
      | ~ ssList(X0) ),
    inference(definition_unfolding,[],[f74,f204]) ).

fof(f262,plain,
    ! [X2,X0,X1] :
      ( app(X0,X2) != sk3
      | app(app(X0,X1),X2) != sk4
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(definition_unfolding,[],[f207,f205,f206]) ).

tcf(c_314,negated_conjecture,
    ! [X0: $i] :
      ( ( app(X0,sk3) = X0 )
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f228]) ).

tcf(c_315,negated_conjecture,
    ! [X0: $i] :
      ( ( app(sk3,X0) = X0 )
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f229]) ).

tcf(c_386,negated_conjecture,
    ( ( app(sk3,sk3) = sk3 )
    | ~ ssList(sk3) ),
    inference(cnf_transformation,[],[f291]) ).

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

tcf(c_430,negated_conjecture,
    ssList(sk4),
    inference(cnf_transformation,[],[f203]) ).

tcf(c_431,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X2) != sk3 )
      | ( app(app(X0,X1),X2) != sk4 ) ),
    inference(cnf_transformation,[],[f262]) ).

tcf(c_546,negated_conjecture,
    app(sk3,sk3) = sk3,
    inference(global_subsumption_just,[status(thm)],[c_386,c_429,c_386]) ).

tcf(c_6442,definition,
    iPr_def_12 = app(sk3,sk3),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_6443,negated_conjecture,
    iPr_def_12 = sk3,
    inference(demodulation,[status(thm)],[c_546,c_6442]) ).

tcf(c_6447,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X2) != sk3 )
      | ( app(app(X0,X1),X2) != sk4 ) ),
    inference(demodulation,[status(thm)],[c_431]) ).

tcf(c_6470,negated_conjecture,
    ! [X0: $i] :
      ( ( app(sk3,X0) = X0 )
      | ~ ssList(X0) ),
    inference(demodulation,[status(thm)],[c_315]) ).

tcf(c_6471,negated_conjecture,
    ! [X0: $i] :
      ( ( app(X0,sk3) = X0 )
      | ~ ssList(X0) ),
    inference(demodulation,[status(thm)],[c_314]) ).

tcf(c_6491,negated_conjecture,
    ssList(sk4),
    inference(demodulation,[status(thm)],[c_430]) ).

tcf(c_6492,negated_conjecture,
    ssList(sk3),
    inference(demodulation,[status(thm)],[c_429]) ).

tcf(c_8992,plain,
    app(iPr_def_12,iPr_def_12) = iPr_def_12,
    inference(light_normalisation,[status(thm)],[c_6442,c_6443]) ).

tcf(c_8993,plain,
    ssList(iPr_def_12),
    inference(light_normalisation,[status(thm)],[c_6492,c_6443]) ).

tcf(c_9091,plain,
    ! [X0: $i] :
      ( ( app(iPr_def_12,X0) = X0 )
      | ~ ssList(X0) ),
    inference(light_normalisation,[status(thm)],[c_6470,c_6443]) ).

tcf(c_9098,plain,
    app(iPr_def_12,sk4) = sk4,
    inference(superposition,[status(thm)],[c_6491,c_9091]) ).

tcf(c_9124,plain,
    ! [X0: $i] :
      ( ( app(X0,iPr_def_12) = X0 )
      | ~ ssList(X0) ),
    inference(light_normalisation,[status(thm)],[c_6471,c_6443]) ).

tcf(c_9131,plain,
    app(sk4,iPr_def_12) = sk4,
    inference(superposition,[status(thm)],[c_6491,c_9124]) ).

tcf(c_10023,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X2) != iPr_def_12 )
      | ( app(app(X0,X1),X2) != sk4 ) ),
    inference(light_normalisation,[status(thm)],[c_6447,c_6443]) ).

tcf(c_10040,plain,
    ! [X0: $i] :
      ( ~ ssList(iPr_def_12)
      | ~ ssList(sk4)
      | ~ ssList(X0)
      | ( app(iPr_def_12,X0) != iPr_def_12 )
      | ( app(sk4,X0) != sk4 ) ),
    inference(superposition,[status(thm)],[c_9098,c_10023]) ).

tcf(c_10046,plain,
    ! [X0: $i] :
      ( ~ ssList(X0)
      | ( app(iPr_def_12,X0) != iPr_def_12 )
      | ( app(sk4,X0) != sk4 ) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_10040,c_8993,c_6491]) ).

tcf(c_10891,plain,
    ( ~ ssList(iPr_def_12)
    | ( app(sk4,iPr_def_12) != sk4 ) ),
    inference(superposition,[status(thm)],[c_8992,c_10046]) ).

tcf(c_10896,plain,
    ~ ssList(iPr_def_12),
    inference(ground_joinability,[status(thm)],[c_10891,c_9131]) ).

tcf(c_10897,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_10896,c_8993]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC007-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.10/5.37  % Computer : n011.cluster.edu
% 0.10/5.37  % Model    : x86_64 x86_64
% 0.10/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37  % Memory   : 8046.5625MB
% 0.10/5.37  % OS       : Linux 6.8.0-71-generic
% 0.10/5.38  % CPULimit : 300
% 0.10/5.38  % WCLimit  : 300
% 0.10/5.38  % DateTime : Thu Sep 24 15:53:03 UTC 2026
% 0.10/5.38  % CPUTime  : 
% 0.10/5.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.42  Running first-order theorem proving
% 0.15/5.42  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.15/5.43  
% 0.15/5.43  % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43  
% 0.15/5.43  % Detected problem language: tptp
% 0.15/5.44  % Proving...
% 1.08/6.29  % SZS status Started for theBenchmark.p
% 1.08/6.29  % SZS status Unsatisfiable for theBenchmark.p
% 1.08/6.29  
% 1.08/6.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.08/6.29  
% 1.08/6.29  % ------  iProver source info
% 1.08/6.29  
% 1.08/6.29  % git: date: 2026-07-19 20:42:38 +0200
% 1.08/6.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.08/6.29  % git: non_committed_changes: false
% 1.08/6.29  
% 1.08/6.29  % ------ Parsing...% successful
% 1.08/6.29  
% 1.08/6.29  
% 1.08/6.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.08/6.29  
% 1.08/6.29  % ------ 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 % 
% 1.08/6.29  
% 1.08/6.29  % ------ Preprocessing... gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.08/6.29  
% 1.08/6.29  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.08/6.29  % ------ Proving...
% 1.08/6.29  % ------ Problem Properties 
% 1.08/6.29  
% 1.08/6.29  % 
% 1.08/6.29  % clauses                               180
% 1.08/6.29  % conjectures                           50
% 1.08/6.29  % EPR                                   54
% 1.08/6.29  % Horn                                  152
% 1.08/6.29  % unary                                 60
% 1.08/6.29  % binary                                21
% 1.08/6.29  % lits                                  548
% 1.08/6.29  % lits eq                               72
% 1.08/6.29  % fd_pure                               0
% 1.08/6.29  % fd_pseudo                             0
% 1.08/6.29  % fd_cond                               15
% 1.08/6.29  % fd_pseudo_cond                        14
% 1.08/6.29  % AC symbols                            0
% 1.08/6.29  
% 1.08/6.29  % ------ Schedule dynamic 5 is on 
% 1.08/6.29  
% 1.08/6.29  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.08/6.29  
% 1.08/6.29  
% 1.08/6.29  % ------ 
% 1.08/6.29  % Current options:
% 1.08/6.29  % ------ 
% 1.08/6.29  
% 1.08/6.29  
% 1.08/6.29  % 
% 1.08/6.29  
% 1.08/6.29  % ------ Proving...
% 1.08/6.29  % 
% 1.08/6.29  
% 1.08/6.29  % SZS status Unsatisfiable for theBenchmark.p
% 1.08/6.29  
% 1.08/6.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.08/6.29  
% 1.08/6.29  
%------------------------------------------------------------------------------