↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : LCL249-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 : n009.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:10 PM UTC 2026

% Result   : Unsatisfiable 10.50s 2.76s
% Output   : CNFRefutation 10.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   48 (  34 unt;   0 def)
%            Number of atoms       :   66 (   2 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   41 (  23   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 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  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   89 (   0 sgn  89   !;   0   ?;  58   :)

% 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(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).

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,axiom,
    ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).

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

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

fof(f12,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(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,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

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

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

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

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

tcf(c_60,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,[],[f12]) ).

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] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(cnf_transformation,[],[f14]) ).

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

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

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

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

tcf(c_95,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_66,c_60]) ).

tcf(c_100,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_66,c_61]) ).

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

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

tcf(c_115,plain,
    ! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[status(thm)],[c_66,c_64]) ).

tcf(c_217,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(X1,X0))
      | ~ theorem(or(X0,X1)) ),
    inference(superposition,[status(thm)],[c_105,c_65]) ).

tcf(c_219,plain,
    ! [X0: $i] :
      ( theorem(X0)
      | ~ theorem(or(X0,X0)) ),
    inference(superposition,[status(thm)],[c_115,c_65]) ).

tcf(c_327,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(not(or(X2,X0)),or(X2,X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(superposition,[status(thm)],[c_95,c_65]) ).

tcf(c_449,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(X1,or(X0,X2)))
      | ~ theorem(or(X0,or(X1,X2))) ),
    inference(superposition,[status(thm)],[c_100,c_65]) ).

tcf(c_502,plain,
    ! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
    inference(superposition,[status(thm)],[c_95,c_449]) ).

tcf(c_505,plain,
    ! [X0: $i,X1: $i] : theorem(or(X0,or(not(X1),X1))),
    inference(superposition,[status(thm)],[c_110,c_449]) ).

tcf(c_671,plain,
    ! [X0: $i] : theorem(or(not(X0),X0)),
    inference(superposition,[status(thm)],[c_505,c_219]) ).

tcf(c_680,plain,
    ! [X0: $i] : theorem(or(X0,not(X0))),
    inference(superposition,[status(thm)],[c_671,c_217]) ).

tcf(c_795,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(X2,X1))
      | ~ theorem(or(X2,X0))
      | ~ theorem(or(not(X0),X1)) ),
    inference(superposition,[status(thm)],[c_327,c_65]) ).

tcf(c_930,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(X0,or(X2,X1)))
      | ~ theorem(or(X0,or(X1,X2))) ),
    inference(superposition,[status(thm)],[c_105,c_795]) ).

tcf(c_939,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(X0,not(not(X1))))
      | ~ theorem(or(X0,X1)) ),
    inference(superposition,[status(thm)],[c_680,c_795]) ).

tcf(c_2095,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(not(not(X1)),X0))
      | ~ theorem(or(X0,X1)) ),
    inference(superposition,[status(thm)],[c_939,c_217]) ).

tcf(c_4315,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(not(or(not(X1),X2)),or(X0,X2)))
      | ~ theorem(or(X0,X1)) ),
    inference(superposition,[status(thm)],[c_502,c_65]) ).

tcf(c_4447,plain,
    ~ theorem(or(not(not(or(not(p),not(q)))),p)),
    inference(superposition,[status(thm)],[c_4315,c_59]) ).

tcf(c_5310,plain,
    ~ theorem(or(p,or(not(p),not(q)))),
    inference(superposition,[status(thm)],[c_2095,c_4447]) ).

tcf(c_19139,plain,
    ! [X0: $i,X1: $i] : theorem(or(not(X0),or(X0,X1))),
    inference(superposition,[status(thm)],[c_110,c_930]) ).

tcf(c_19702,plain,
    ! [X0: $i,X1: $i] : theorem(or(X0,or(not(X0),X1))),
    inference(superposition,[status(thm)],[c_19139,c_449]) ).

tcf(c_19713,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_5310,c_19702]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL249-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.12/0.38  % Computer : n009.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Wed Sep 23 22:35:44 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.43  Running first-order theorem proving
% 0.12/0.43  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.12/0.44  
% 0.12/0.44  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.44  
% 0.12/0.44  % Detected problem language: tptp
% 0.12/0.45  % Proving...
% 10.50/2.76  % SZS status Started for theBenchmark.p
% 10.50/2.76  % SZS status Unsatisfiable for theBenchmark.p
% 10.50/2.76  
% 10.50/2.76  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.50/2.76  
% 10.50/2.76  % ------  iProver source info
% 10.50/2.76  
% 10.50/2.76  % git: date: 2026-07-19 20:42:38 +0200
% 10.50/2.76  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.50/2.76  % git: non_committed_changes: false
% 10.50/2.76  
% 10.50/2.76  % ------ Parsing...% successful
% 10.50/2.76  
% 10.50/2.76  
% 10.50/2.76  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 10.50/2.76  
% 10.50/2.76  % ------ 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 % 
% 10.50/2.76  
% 10.50/2.76  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 10.50/2.76  % ------ Proving...
% 10.50/2.76  % ------ Problem Properties 
% 10.50/2.76  
% 10.50/2.76  % 
% 10.50/2.76  % clauses                               7
% 10.50/2.76  % conjectures                           1
% 10.50/2.76  % EPR                                   0
% 10.50/2.76  % Horn                                  7
% 10.50/2.76  % unary                                 6
% 10.50/2.76  % binary                                0
% 10.50/2.76  % lits                                  9
% 10.50/2.76  % lits eq                               0
% 10.50/2.76  % fd_pure                               0
% 10.50/2.76  % fd_pseudo                             0
% 10.50/2.76  % fd_cond                               0
% 10.50/2.76  % fd_pseudo_cond                        0
% 10.50/2.76  % AC symbols                            0
% 10.50/2.76  
% 10.50/2.76  % ------ Schedule dynamic 5 is on 
% 10.50/2.76  
% 10.50/2.76  % ------ no equalities: superposition off 
% 10.50/2.76  
% 10.50/2.76  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.50/2.76  
% 10.50/2.76  
% 10.50/2.76  % ------ 
% 10.50/2.76  % Current options:
% 10.50/2.76  % ------ 
% 10.50/2.76  
% 10.50/2.76  
% 10.50/2.76  % 
% 10.50/2.76  
% 10.50/2.76  % ------ Proving...
% 10.50/2.76  % 
% 10.50/2.76  
% 10.50/2.76  % SZS status Unsatisfiable for theBenchmark.p
% 10.50/2.76  
% 10.50/2.76  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.50/2.76  
% 10.50/2.76  
%------------------------------------------------------------------------------