↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n020.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:06:06 PM UTC 2026

% Result   : Unsatisfiable 1.34s 1.73s
% Output   : CNFRefutation 1.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   60 (  47 unt;  10 def)
%            Number of atoms       :  146 (  11 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   42 (  24   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   14 (  12 usr;  11 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   67 (   0 sgn  67   !;   0   ?;  42   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : axiom(implies(or(X0,X0),X0)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( ~ theorem(X1)
      | ~ theorem(implies(X1,X0))
      | theorem(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).

fof(f9,negated_conjecture,
    ~ theorem(implies(implies(implies(p,q),implies(p,r)),implies(p,implies(q,r)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f10,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

fof(f11,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

fof(f13,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f14,plain,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ~ theorem(X1)
      | ~ theorem(or(not(X1),X0))
      | theorem(X0) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f16,plain,
    ~ theorem(or(not(or(not(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r)))),
    inference(definition_unfolding,[],[f9,f6,f6,f6,f6,f6,f6]) ).

tcf(c_58,plain,
    ! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_59,plain,
    ! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_61,plain,
    ! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(cnf_transformation,[],[f13]) ).

tcf(c_62,plain,
    ! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_63,plain,
    ! [X0: $i] :
      ( theorem(X0)
      | ~ axiom(X0) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_64,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(X1)
      | ~ theorem(X0)
      | ~ theorem(or(not(X0),X1)) ),
    inference(cnf_transformation,[],[f15]) ).

tcf(c_65,negated_conjecture,
    ~ theorem(or(not(or(not(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r)))),
    inference(cnf_transformation,[],[f16]) ).

tcf(c_94,plain,
    ! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[status(thm)],[c_63,c_58]) ).

tcf(c_99,plain,
    ! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[status(thm)],[c_63,c_59]) ).

tcf(c_109,plain,
    ! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[status(thm)],[c_63,c_61]) ).

tcf(c_114,plain,
    ! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(resolution,[status(thm)],[c_63,c_62]) ).

tcf(c_142,definition,
    iPr_def_10 = not(p),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_143,definition,
    iPr_def_11 = or(iPr_def_10,q),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_144,definition,
    iPr_def_12 = not(iPr_def_11),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_145,definition,
    iPr_def_13 = or(iPr_def_10,r),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_146,definition,
    iPr_def_14 = or(iPr_def_12,iPr_def_13),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_147,definition,
    iPr_def_15 = not(iPr_def_14),
    introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).

tcf(c_148,definition,
    iPr_def_16 = not(q),
    introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).

tcf(c_149,definition,
    iPr_def_17 = or(iPr_def_16,r),
    introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).

tcf(c_150,definition,
    iPr_def_18 = or(iPr_def_10,iPr_def_17),
    introduced(definition,[new_symbols(definition,[iPr_def_18])],[]) ).

tcf(c_151,definition,
    iPr_def_19 = or(iPr_def_15,iPr_def_18),
    introduced(definition,[new_symbols(definition,[iPr_def_19])],[]) ).

tcf(c_152,negated_conjecture,
    ~ theorem(iPr_def_19),
    inference(demodulation,[status(thm)],[c_65,c_148,c_149,c_150,c_145,c_142,c_143,c_144,c_146,c_147,c_151]) ).

tcf(c_292,plain,
    ! [X0: $i] :
      ( theorem(X0)
      | ~ theorem(or(X0,X0)) ),
    inference(superposition,[status(thm)],[c_94,c_64]) ).

tcf(c_319,plain,
    theorem(or(not(q),iPr_def_11)),
    inference(superposition,[status(thm)],[c_143,c_99]) ).

tcf(c_326,plain,
    theorem(or(iPr_def_16,iPr_def_11)),
    inference(light_normalisation,[status(thm)],[c_319,c_148]) ).

tcf(c_448,plain,
    ! [X0: $i] : theorem(or(not(or(X0,iPr_def_13)),or(iPr_def_10,or(X0,r)))),
    inference(superposition,[status(thm)],[c_145,c_109]) ).

tcf(c_459,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(X1,or(X0,X2)))
      | ~ theorem(or(X0,or(X1,X2))) ),
    inference(superposition,[status(thm)],[c_109,c_64]) ).

tcf(c_652,plain,
    ! [X0: $i,X1: $i] : theorem(or(not(or(iPr_def_12,X0)),or(not(or(X1,iPr_def_11)),or(X1,X0)))),
    inference(superposition,[status(thm)],[c_144,c_114]) ).

tcf(c_665,plain,
    ! [X0: $i] : theorem(or(not(or(not(X0),iPr_def_18)),or(not(or(iPr_def_15,X0)),iPr_def_19))),
    inference(superposition,[status(thm)],[c_151,c_114]) ).

tcf(c_995,plain,
    theorem(or(not(or(iPr_def_16,iPr_def_13)),or(iPr_def_10,iPr_def_17))),
    inference(superposition,[status(thm)],[c_149,c_448]) ).

tcf(c_998,plain,
    theorem(or(not(or(iPr_def_16,iPr_def_13)),iPr_def_18)),
    inference(light_normalisation,[status(thm)],[c_995,c_150]) ).

tcf(c_1432,plain,
    ! [X0: $i,X1: $i] : theorem(or(X0,or(not(X1),X1))),
    inference(superposition,[status(thm)],[c_99,c_459]) ).

tcf(c_1837,plain,
    ! [X0: $i] : theorem(or(not(X0),X0)),
    inference(superposition,[status(thm)],[c_1432,c_292]) ).

tcf(c_1852,plain,
    ! [X0: $i,X1: $i] : theorem(or(X0,or(not(or(X0,X1)),X1))),
    inference(superposition,[status(thm)],[c_1837,c_459]) ).

tcf(c_2281,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(not(or(X1,iPr_def_11)),or(X1,X0)))
      | ~ theorem(or(iPr_def_12,X0)) ),
    inference(superposition,[status(thm)],[c_652,c_64]) ).

tcf(c_2740,plain,
    theorem(or(iPr_def_12,or(not(iPr_def_14),iPr_def_13))),
    inference(superposition,[status(thm)],[c_146,c_1852]) ).

tcf(c_2763,plain,
    theorem(or(iPr_def_12,or(iPr_def_15,iPr_def_13))),
    inference(light_normalisation,[status(thm)],[c_2740,c_147]) ).

tcf(c_4379,plain,
    ! [X0: $i] :
      ( theorem(or(not(or(iPr_def_15,X0)),iPr_def_19))
      | ~ theorem(or(not(X0),iPr_def_18)) ),
    inference(superposition,[status(thm)],[c_665,c_64]) ).

tcf(c_5878,plain,
    ! [X0: $i] :
      ( theorem(iPr_def_19)
      | ~ theorem(or(iPr_def_15,X0))
      | ~ theorem(or(not(X0),iPr_def_18)) ),
    inference(superposition,[status(thm)],[c_4379,c_64]) ).

tcf(c_5882,plain,
    ! [X0: $i] :
      ( ~ theorem(or(iPr_def_15,X0))
      | ~ theorem(or(not(X0),iPr_def_18)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_5878,c_152]) ).

tcf(c_5910,plain,
    ~ theorem(or(iPr_def_15,or(iPr_def_16,iPr_def_13))),
    inference(superposition,[status(thm)],[c_998,c_5882]) ).

tcf(c_6206,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(X0,X1))
      | ~ theorem(or(iPr_def_12,X1))
      | ~ theorem(or(X0,iPr_def_11)) ),
    inference(superposition,[status(thm)],[c_2281,c_64]) ).

tcf(c_6838,plain,
    ! [X0: $i] :
      ( theorem(or(iPr_def_16,X0))
      | ~ theorem(or(iPr_def_12,X0)) ),
    inference(superposition,[status(thm)],[c_326,c_6206]) ).

tcf(c_10294,plain,
    theorem(or(iPr_def_16,or(iPr_def_15,iPr_def_13))),
    inference(superposition,[status(thm)],[c_2763,c_6838]) ).

tcf(c_11067,plain,
    theorem(or(iPr_def_15,or(iPr_def_16,iPr_def_13))),
    inference(superposition,[status(thm)],[c_10294,c_459]) ).

tcf(c_11068,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_11067,c_5910]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL231-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36  % Computer : n020.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Wed Sep 23 22:30:33 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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.10/0.42  
% 0.10/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42  
% 0.10/0.42  % Detected problem language: tptp
% 0.10/0.43  % Proving...
% 1.34/1.73  % SZS status Started for theBenchmark.p
% 1.34/1.73  % SZS status Unsatisfiable for theBenchmark.p
% 1.34/1.73  
% 1.34/1.73  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.34/1.73  
% 1.34/1.73  % ------  iProver source info
% 1.34/1.73  
% 1.34/1.73  % git: date: 2026-07-19 20:42:38 +0200
% 1.34/1.73  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.34/1.73  % git: non_committed_changes: false
% 1.34/1.73  
% 1.34/1.73  % ------ Parsing...% successful
% 1.34/1.73  
% 1.34/1.73  
% 1.34/1.73  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.34/1.73  
% 1.34/1.73  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe:1:0s pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 1.34/1.73  
% 1.34/1.73  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.34/1.73  
% 1.34/1.73  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.34/1.73  % ------ Proving...
% 1.34/1.73  % ------ Problem Properties 
% 1.34/1.73  
% 1.34/1.73  % 
% 1.34/1.73  % clauses                               17
% 1.34/1.73  % conjectures                           1
% 1.34/1.73  % EPR                                   1
% 1.34/1.73  % Horn                                  17
% 1.34/1.73  % unary                                 16
% 1.34/1.73  % binary                                0
% 1.34/1.73  % lits                                  19
% 1.34/1.73  % lits eq                               10
% 1.34/1.73  % fd_pure                               0
% 1.34/1.73  % fd_pseudo                             0
% 1.34/1.73  % fd_cond                               0
% 1.34/1.73  % fd_pseudo_cond                        0
% 1.34/1.73  % AC symbols                            0
% 1.34/1.73  
% 1.34/1.73  % ------ Schedule dynamic 5 is on 
% 1.34/1.73  
% 1.34/1.73  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.34/1.73  
% 1.34/1.73  
% 1.34/1.73  % ------ 
% 1.34/1.73  % Current options:
% 1.34/1.73  % ------ 
% 1.34/1.73  
% 1.34/1.73  
% 1.34/1.73  % 
% 1.34/1.73  
% 1.34/1.73  % ------ Proving...
% 1.34/1.73  % 
% 1.34/1.73  
% 1.34/1.73  % SZS status Unsatisfiable for theBenchmark.p
% 1.34/1.73  
% 1.34/1.73  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.34/1.73  
% 1.34/1.73  
%------------------------------------------------------------------------------