↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : LCL196-1 : TPTP v9.3.1. Released v1.1.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 02:05:56 PM UTC 2026

% Result   : Unsatisfiable 22.69s 3.92s
% Output   : CNFRefutation 22.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   54 (  26 unt;   0 def)
%            Number of atoms       :  106 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  106 (  54   ~;  52   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   84 (   0 sgn  84   !;   0   ?;  67   :)

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

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

fof(f3,axiom,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).

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

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

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

fof(f7,axiom,
    ! [X0,X1] :
      ( ~ theorem(X1)
      | ~ axiom(or(not(X1),X0))
      | theorem(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_2) ).

fof(f8,axiom,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X2),X1))
      | ~ axiom(or(not(X0),X2))
      | theorem(or(not(X0),X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).

fof(f9,negated_conjecture,
    ~ theorem(or(not(or(p,or(p,q))),or(p,q))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

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

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

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

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,[],[f4]) ).

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,[],[f5]) ).

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

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

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

tcf(c_66,negated_conjecture,
    ~ theorem(or(not(or(p,or(p,q))),or(p,q))),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_226,plain,
    ! [X0: $i] :
      ( theorem(or(not(or(p,or(p,q))),or(p,q)))
      | ~ theorem(X0)
      | ~ axiom(or(not(X0),or(not(or(p,or(p,q))),or(p,q)))) ),
    inference(instantiation,[status(thm)],[c_64]) ).

tcf(c_232,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(not(X1),or(p,q)))
      | ~ axiom(or(not(X1),X0))
      | ~ theorem(or(not(X0),or(p,q))) ),
    inference(instantiation,[status(thm)],[c_65]) ).

tcf(c_233,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(X2)
      | ~ theorem(or(not(X0),X1))
      | ~ axiom(or(not(or(not(X0),X1)),X2)) ),
    inference(instantiation,[status(thm)],[c_64]) ).

tcf(c_238,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(not(X1),or(p,q)))
      | ~ axiom(or(not(X1),or(X0,X1)))
      | ~ theorem(or(not(or(X0,X1)),or(p,q))) ),
    inference(instantiation,[status(thm)],[c_232]) ).

tcf(c_246,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(not(or(X0,X1)),or(X1,X0)))
      | ~ axiom(or(not(or(X0,X1)),or(X1,X0))) ),
    inference(instantiation,[status(thm)],[c_63]) ).

tcf(c_257,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(X1,or(not(X0),X2)))
      | ~ theorem(or(not(X0),or(X1,X2)))
      | ~ axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2)))) ),
    inference(instantiation,[status(thm)],[c_233]) ).

tcf(c_259,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(not(or(X2,X0)),or(X2,X1)))
      | ~ theorem(or(not(X0),X1))
      | ~ axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) ),
    inference(instantiation,[status(thm)],[c_233]) ).

tcf(c_276,plain,
    ( theorem(or(not(or(q,p)),or(p,q)))
    | ~ axiom(or(not(or(q,p)),or(p,q))) ),
    inference(instantiation,[status(thm)],[c_246]) ).

tcf(c_298,plain,
    ( theorem(or(not(p),or(p,q)))
    | ~ axiom(or(not(p),or(q,p)))
    | ~ theorem(or(not(or(q,p)),or(p,q))) ),
    inference(instantiation,[status(thm)],[c_238]) ).

tcf(c_313,plain,
    ! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2)))),
    inference(instantiation,[status(thm)],[c_61]) ).

tcf(c_332,plain,
    axiom(or(not(p),or(q,p))),
    inference(instantiation,[status(thm)],[c_59]) ).

tcf(c_357,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( theorem(X3)
      | ~ theorem(or(X0,or(not(X1),X2)))
      | ~ axiom(or(not(or(X0,or(not(X1),X2))),X3)) ),
    inference(instantiation,[status(thm)],[c_64]) ).

tcf(c_358,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(not(or(p,or(p,q))),or(p,q)))
      | ~ theorem(or(X0,or(not(X1),X2)))
      | ~ axiom(or(not(or(X0,or(not(X1),X2))),or(not(or(p,or(p,q))),or(p,q)))) ),
    inference(instantiation,[status(thm)],[c_226]) ).

tcf(c_397,plain,
    axiom(or(not(or(q,p)),or(p,q))),
    inference(instantiation,[status(thm)],[c_60]) ).

tcf(c_454,plain,
    ( theorem(or(not(or(p,or(p,q))),or(p,q)))
    | ~ theorem(or(or(not(or(p,or(p,q))),or(p,q)),or(not(or(p,or(p,q))),or(p,q))))
    | ~ axiom(or(not(or(or(not(or(p,or(p,q))),or(p,q)),or(not(or(p,or(p,q))),or(p,q)))),or(not(or(p,or(p,q))),or(p,q)))) ),
    inference(instantiation,[status(thm)],[c_358]) ).

tcf(c_470,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(or(not(X1),X2),X0))
      | ~ theorem(or(X0,or(not(X1),X2)))
      | ~ axiom(or(not(or(X0,or(not(X1),X2))),or(or(not(X1),X2),X0))) ),
    inference(instantiation,[status(thm)],[c_357]) ).

tcf(c_567,plain,
    axiom(or(not(or(or(not(or(p,or(p,q))),or(p,q)),or(not(or(p,or(p,q))),or(p,q)))),or(not(or(p,or(p,q))),or(p,q)))),
    inference(instantiation,[status(thm)],[c_58]) ).

tcf(c_632,plain,
    ! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(not(X1),X2))),or(or(not(X1),X2),X0))),
    inference(instantiation,[status(thm)],[c_60]) ).

tcf(c_666,plain,
    axiom(or(not(or(p,or(p,q))),or(or(p,q),p))),
    inference(instantiation,[status(thm)],[c_60]) ).

tcf(c_684,plain,
    ( theorem(or(or(not(or(p,or(p,q))),or(p,q)),or(not(or(p,or(p,q))),or(p,q))))
    | ~ theorem(or(not(or(p,or(p,q))),or(or(not(or(p,or(p,q))),or(p,q)),or(p,q))))
    | ~ axiom(or(not(or(not(or(p,or(p,q))),or(or(not(or(p,or(p,q))),or(p,q)),or(p,q)))),or(or(not(or(p,or(p,q))),or(p,q)),or(not(or(p,or(p,q))),or(p,q))))) ),
    inference(instantiation,[status(thm)],[c_257]) ).

tcf(c_904,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( theorem(X3)
      | ~ theorem(or(or(not(X0),X1),X2))
      | ~ axiom(or(not(or(or(not(X0),X1),X2)),X3)) ),
    inference(instantiation,[status(thm)],[c_64]) ).

tcf(c_956,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X3,or(X0,or(X1,X2))))),
    inference(instantiation,[status(thm)],[c_59]) ).

tcf(c_1052,plain,
    axiom(or(not(or(not(or(p,or(p,q))),or(or(not(or(p,or(p,q))),or(p,q)),or(p,q)))),or(or(not(or(p,or(p,q))),or(p,q)),or(not(or(p,or(p,q))),or(p,q))))),
    inference(instantiation,[status(thm)],[c_313]) ).

tcf(c_1337,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( theorem(or(X3,or(or(not(X0),X1),X2)))
      | ~ theorem(or(or(not(X0),X1),X2))
      | ~ axiom(or(not(or(or(not(X0),X1),X2)),or(X3,or(or(not(X0),X1),X2)))) ),
    inference(instantiation,[status(thm)],[c_904]) ).

tcf(c_3029,plain,
    ( theorem(or(not(or(p,or(p,q))),or(or(not(or(p,or(p,q))),or(p,q)),or(p,q))))
    | ~ theorem(or(or(not(or(p,or(p,q))),or(p,q)),or(p,q)))
    | ~ axiom(or(not(or(or(not(or(p,or(p,q))),or(p,q)),or(p,q))),or(not(or(p,or(p,q))),or(or(not(or(p,or(p,q))),or(p,q)),or(p,q))))) ),
    inference(instantiation,[status(thm)],[c_1337]) ).

tcf(c_3600,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : axiom(or(not(or(or(not(X0),X1),or(X2,X3))),or(X4,or(or(not(X0),X1),or(X2,X3))))),
    inference(instantiation,[status(thm)],[c_956]) ).

tcf(c_4416,plain,
    ( theorem(or(or(not(or(p,or(p,q))),or(p,q)),or(p,q)))
    | ~ theorem(or(or(p,q),or(not(or(p,or(p,q))),or(p,q))))
    | ~ axiom(or(not(or(or(p,q),or(not(or(p,or(p,q))),or(p,q)))),or(or(not(or(p,or(p,q))),or(p,q)),or(p,q)))) ),
    inference(instantiation,[status(thm)],[c_470]) ).

tcf(c_10151,plain,
    axiom(or(not(or(or(p,q),or(not(or(p,or(p,q))),or(p,q)))),or(or(not(or(p,or(p,q))),or(p,q)),or(p,q)))),
    inference(instantiation,[status(thm)],[c_632]) ).

tcf(c_11196,plain,
    ( theorem(or(or(p,q),or(not(or(p,or(p,q))),or(p,q))))
    | ~ theorem(or(not(or(p,or(p,q))),or(or(p,q),or(p,q))))
    | ~ axiom(or(not(or(not(or(p,or(p,q))),or(or(p,q),or(p,q)))),or(or(p,q),or(not(or(p,or(p,q))),or(p,q))))) ),
    inference(instantiation,[status(thm)],[c_257]) ).

tcf(c_20046,plain,
    axiom(or(not(or(not(or(p,or(p,q))),or(or(p,q),or(p,q)))),or(or(p,q),or(not(or(p,or(p,q))),or(p,q))))),
    inference(instantiation,[status(thm)],[c_313]) ).

tcf(c_28430,plain,
    ! [X0: $i] :
      ( theorem(or(not(or(p,or(p,q))),or(or(p,q),or(p,q))))
      | ~ axiom(or(not(or(p,or(p,q))),X0))
      | ~ theorem(or(not(X0),or(or(p,q),or(p,q)))) ),
    inference(instantiation,[status(thm)],[c_65]) ).

tcf(c_42239,plain,
    ( theorem(or(not(or(p,or(p,q))),or(or(p,q),or(p,q))))
    | ~ axiom(or(not(or(p,or(p,q))),or(or(p,q),p)))
    | ~ theorem(or(not(or(or(p,q),p)),or(or(p,q),or(p,q)))) ),
    inference(instantiation,[status(thm)],[c_28430]) ).

tcf(c_50618,plain,
    ( theorem(or(not(or(or(p,q),p)),or(or(p,q),or(p,q))))
    | ~ theorem(or(not(p),or(p,q)))
    | ~ axiom(or(not(or(not(p),or(p,q))),or(not(or(or(p,q),p)),or(or(p,q),or(p,q))))) ),
    inference(instantiation,[status(thm)],[c_259]) ).

tcf(c_61061,plain,
    axiom(or(not(or(not(p),or(p,q))),or(not(or(or(p,q),p)),or(or(p,q),or(p,q))))),
    inference(instantiation,[status(thm)],[c_62]) ).

tcf(c_63366,plain,
    axiom(or(not(or(or(not(or(p,or(p,q))),or(p,q)),or(p,q))),or(not(or(p,or(p,q))),or(or(not(or(p,or(p,q))),or(p,q)),or(p,q))))),
    inference(instantiation,[status(thm)],[c_3600]) ).

tcf(c_63367,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_63366,c_61061,c_50618,c_42239,c_20046,c_11196,c_10151,c_4416,c_3029,c_1052,c_684,c_666,c_567,c_454,c_397,c_332,c_298,c_276,c_66]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL196-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37  % Computer : n011.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Wed Sep 23 22:17:44 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.43  Running first-order theorem proving
% 0.15/0.43  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/0.45  
% 0.15/0.45  % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.45  
% 0.15/0.45  % Detected problem language: tptp
% 0.15/0.47  % Proving...
% 22.69/3.92  % SZS status Started for theBenchmark.p
% 22.69/3.92  % SZS status Unsatisfiable for theBenchmark.p
% 22.69/3.92  
% 22.69/3.92  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 22.69/3.92  
% 22.69/3.92  % ------  iProver source info
% 22.69/3.92  
% 22.69/3.92  % git: date: 2026-07-19 20:42:38 +0200
% 22.69/3.92  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 22.69/3.92  % git: non_committed_changes: false
% 22.69/3.92  
% 22.69/3.92  % ------ Parsing...% successful
% 22.69/3.92  
% 22.69/3.92  
% 22.69/3.92  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 22.69/3.92  
% 22.69/3.92  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 22.69/3.92  
% 22.69/3.92  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 22.69/3.92  % ------ Proving...
% 22.69/3.92  % ------ Problem Properties 
% 22.69/3.92  
% 22.69/3.92  % 
% 22.69/3.92  % clauses                               9
% 22.69/3.92  % conjectures                           1
% 22.69/3.92  % EPR                                   1
% 22.69/3.92  % Horn                                  9
% 22.69/3.92  % unary                                 6
% 22.69/3.92  % binary                                1
% 22.69/3.92  % lits                                  14
% 22.69/3.92  % lits eq                               0
% 22.69/3.92  % fd_pure                               0
% 22.69/3.92  % fd_pseudo                             0
% 22.69/3.92  % fd_cond                               0
% 22.69/3.92  % fd_pseudo_cond                        0
% 22.69/3.92  % AC symbols                            0
% 22.69/3.92  
% 22.69/3.92  % ------ Input Options Time Limit: Unbounded
% 22.69/3.92  
% 22.69/3.92  
% 22.69/3.92  % ------ 
% 22.69/3.92  % Current options:
% 22.69/3.92  % ------ 
% 22.69/3.92  
% 22.69/3.92  
% 22.69/3.92  % 
% 22.69/3.92  
% 22.69/3.92  % ------ Proving...
% 22.69/3.92  % 
% 22.69/3.92  
% 22.69/3.92  % SZS status Unsatisfiable for theBenchmark.p
% 22.69/3.92  
% 22.69/3.92  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 22.69/3.93  
% 22.69/3.93  
%------------------------------------------------------------------------------