↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 18.08s 4.82s
% Output   : CNFRefutation 18.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   64 (  28 unt;   6 def)
%            Number of atoms       :  140 (   6 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   83 (  43   ~;  40   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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  :   10 (   8 usr;   7 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   92 (   0 sgn  92   !;   0   ?;  75   :)

% 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,q)),or(not(not(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,q)),or(not(not(p)),q))),
    inference(cnf_transformation,[],[f9]) ).

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

tcf(c_225,definition,
    iPr_def_10 = or(p,q),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_226,definition,
    iPr_def_11 = not(iPr_def_10),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_227,definition,
    iPr_def_12 = not(p),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_228,definition,
    iPr_def_13 = not(iPr_def_12),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_229,definition,
    iPr_def_14 = or(iPr_def_13,q),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_230,definition,
    iPr_def_15 = or(iPr_def_11,iPr_def_14),
    introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).

tcf(c_231,negated_conjecture,
    ~ theorem(iPr_def_15),
    inference(demodulation,[status(thm)],[c_66,c_227,c_228,c_229,c_225,c_226,c_230]) ).

tcf(c_404,plain,
    ! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(superposition,[status(thm)],[c_60,c_63]) ).

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

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

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

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

tcf(c_499,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_62,c_64]) ).

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

tcf(c_743,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(X0,X1))
      | ~ theorem(X0) ),
    inference(superposition,[status(thm)],[c_413,c_414]) ).

tcf(c_936,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(X0,or(X2,X1)))
      | ~ theorem(or(X0,X1)) ),
    inference(superposition,[status(thm)],[c_413,c_443]) ).

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

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

tcf(c_2102,plain,
    ! [X0: $i] :
      ( theorem(or(X0,iPr_def_14))
      | ~ theorem(or(X0,q)) ),
    inference(superposition,[status(thm)],[c_229,c_936]) ).

tcf(c_2105,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(X0,X1))
      | ~ theorem(or(or(X0,X1),X1)) ),
    inference(superposition,[status(thm)],[c_936,c_412]) ).

tcf(c_3537,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(or(X0,or(X1,X2)),X2)) ),
    inference(superposition,[status(thm)],[c_936,c_2105]) ).

tcf(c_5563,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(X1,not(or(X1,X0))))
      | ~ theorem(or(not(X0),not(or(X1,X0)))) ),
    inference(superposition,[status(thm)],[c_1273,c_2105]) ).

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

tcf(c_10852,plain,
    ! [X0: $i] :
      ( theorem(or(X0,or(iPr_def_13,q)))
      | ~ theorem(or(or(X0,iPr_def_14),q)) ),
    inference(superposition,[status(thm)],[c_229,c_3537]) ).

tcf(c_10857,plain,
    ! [X0: $i] :
      ( theorem(or(X0,iPr_def_14))
      | ~ theorem(or(or(X0,iPr_def_14),q)) ),
    inference(light_normalisation,[status(thm)],[c_10852,c_229]) ).

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

tcf(c_15213,plain,
    ! [X0: $i,X1: $i] : theorem(or(X0,or(not(X0),X1))),
    inference(superposition,[status(thm)],[c_15048,c_443]) ).

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

tcf(c_17282,plain,
    ! [X0: $i] :
      ( theorem(or(X0,not(or(X0,p))))
      | ~ theorem(or(iPr_def_12,not(or(X0,p)))) ),
    inference(superposition,[status(thm)],[c_227,c_5563]) ).

tcf(c_17635,plain,
    ! [X0: $i] :
      ( theorem(or(not(or(q,X0)),iPr_def_14))
      | ~ theorem(or(not(X0),iPr_def_14)) ),
    inference(superposition,[status(thm)],[c_5810,c_10857]) ).

tcf(c_17667,plain,
    ( theorem(or(not(or(q,p)),iPr_def_14))
    | ~ theorem(or(not(p),iPr_def_14)) ),
    inference(instantiation,[status(thm)],[c_17635]) ).

tcf(c_33431,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(not(X0),or(not(iPr_def_12),X1)))
      | ~ axiom(or(not(X0),p)) ),
    inference(superposition,[status(thm)],[c_227,c_15774]) ).

tcf(c_33441,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(not(X0),or(iPr_def_13,X1)))
      | ~ axiom(or(not(X0),p)) ),
    inference(light_normalisation,[status(thm)],[c_33431,c_228]) ).

tcf(c_33481,plain,
    ! [X0: $i] :
      ( theorem(or(not(X0),iPr_def_14))
      | ~ axiom(or(not(X0),p)) ),
    inference(superposition,[status(thm)],[c_229,c_33441]) ).

tcf(c_35720,plain,
    theorem(or(not(or(p,p)),iPr_def_14)),
    inference(superposition,[status(thm)],[c_58,c_33481]) ).

tcf(c_35727,plain,
    ! [X0: $i] :
      ( theorem(or(not(X0),iPr_def_14))
      | ~ axiom(or(not(X0),or(p,p))) ),
    inference(superposition,[status(thm)],[c_35720,c_65]) ).

tcf(c_35733,plain,
    ( theorem(or(not(p),iPr_def_14))
    | ~ axiom(or(not(p),or(p,p))) ),
    inference(instantiation,[status(thm)],[c_35727]) ).

tcf(c_39300,plain,
    ! [X0: $i] :
      ( theorem(or(X0,not(or(X0,p))))
      | ~ theorem(iPr_def_12) ),
    inference(superposition,[status(thm)],[c_743,c_17282]) ).

tcf(c_40173,plain,
    ! [X0: $i] :
      ( theorem(or(not(or(X0,p)),X0))
      | ~ theorem(iPr_def_12) ),
    inference(superposition,[status(thm)],[c_39300,c_414]) ).

tcf(c_40738,plain,
    ( theorem(or(not(or(q,p)),iPr_def_14))
    | ~ theorem(iPr_def_12) ),
    inference(superposition,[status(thm)],[c_40173,c_2102]) ).

tcf(c_40858,plain,
    theorem(or(not(or(q,p)),iPr_def_14)),
    inference(global_subsumption_just,[status(thm)],[c_40738,c_68,c_17667,c_35733]) ).

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

tcf(c_41442,plain,
    theorem(or(not(or(p,q)),iPr_def_14)),
    inference(superposition,[status(thm)],[c_60,c_40860]) ).

tcf(c_41446,plain,
    theorem(iPr_def_15),
    inference(light_normalisation,[status(thm)],[c_41442,c_225,c_226,c_230]) ).

tcf(c_41447,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_41446,c_231]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL208-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.36  % Computer : n002.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:23:33 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/0.40  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.10/0.41  
% 0.10/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41  
% 0.10/0.41  % Detected problem language: tptp
% 0.10/0.42  % Proving...
% 18.08/4.82  % SZS status Started for theBenchmark.p
% 18.08/4.82  % SZS status Unsatisfiable for theBenchmark.p
% 18.08/4.82  
% 18.08/4.82  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 18.08/4.82  
% 18.08/4.82  % ------  iProver source info
% 18.08/4.82  
% 18.08/4.82  % git: date: 2026-07-19 20:42:38 +0200
% 18.08/4.82  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 18.08/4.82  % git: non_committed_changes: false
% 18.08/4.82  
% 18.08/4.82  % ------ Parsing...% successful
% 18.08/4.82  
% 18.08/4.82  
% 18.08/4.82  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 18.08/4.82  
% 18.08/4.82  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 18.08/4.82  
% 18.08/4.82  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 18.08/4.82  
% 18.08/4.82  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 18.08/4.82  % ------ Proving...
% 18.08/4.82  % ------ Problem Properties 
% 18.08/4.82  
% 18.08/4.82  % 
% 18.08/4.82  % clauses                               15
% 18.08/4.82  % conjectures                           1
% 18.08/4.82  % EPR                                   2
% 18.08/4.82  % Horn                                  15
% 18.08/4.82  % unary                                 12
% 18.08/4.82  % binary                                1
% 18.08/4.82  % lits                                  20
% 18.08/4.82  % lits eq                               6
% 18.08/4.82  % fd_pure                               0
% 18.08/4.82  % fd_pseudo                             0
% 18.08/4.82  % fd_cond                               0
% 18.08/4.82  % fd_pseudo_cond                        0
% 18.08/4.82  % AC symbols                            0
% 18.08/4.82  
% 18.08/4.82  % ------ Schedule dynamic 5 is on 
% 18.08/4.82  
% 18.08/4.82  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 18.08/4.82  
% 18.08/4.82  
% 18.08/4.82  % ------ 
% 18.08/4.82  % Current options:
% 18.08/4.82  % ------ 
% 18.08/4.82  
% 18.08/4.82  
% 18.08/4.82  % 
% 18.08/4.82  
% 18.08/4.82  % ------ Proving...
% 18.08/4.82  % 
% 18.08/4.82  
% 18.08/4.82  % SZS status Unsatisfiable for theBenchmark.p
% 18.08/4.82  
% 18.08/4.82  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 18.08/4.82  
% 18.08/4.82  
%------------------------------------------------------------------------------