↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 1.88s 1.27s
% Output   : CNFRefutation 1.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   20 (  15 unt;   3 def)
%            Number of atoms       :   38 (   3 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   17 (  10   ~;   7   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   4 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   17 (   0 sgn  17   !;   0   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
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(f6,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).

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(p),or(p,q))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

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_63,plain,
    ! [X0: $i] :
      ( theorem(X0)
      | ~ axiom(X0) ),
    inference(cnf_transformation,[],[f6]) ).

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

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

tcf(c_226,definition,
    iPr_def_11 = or(p,q),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_227,definition,
    iPr_def_12 = or(iPr_def_10,iPr_def_11),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_228,negated_conjecture,
    ~ theorem(iPr_def_12),
    inference(demodulation,[status(thm)],[c_66,c_226,c_225,c_227]) ).

tcf(c_381,plain,
    axiom(or(not(or(q,p)),iPr_def_11)),
    inference(superposition,[status(thm)],[c_226,c_60]) ).

tcf(c_465,plain,
    theorem(or(not(or(q,p)),iPr_def_11)),
    inference(superposition,[status(thm)],[c_381,c_63]) ).

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

tcf(c_2447,plain,
    theorem(or(not(p),iPr_def_11)),
    inference(superposition,[status(thm)],[c_59,c_557]) ).

tcf(c_2451,plain,
    theorem(iPr_def_12),
    inference(light_normalisation,[status(thm)],[c_2447,c_225,c_227]) ).

tcf(c_2452,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2451,c_228]) ).


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