↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n012.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:50 PM UTC 2026

% Result   : Unsatisfiable 1.13s 1.07s
% Output   : CNFRefutation 1.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   11 (   9 unt;   0 def)
%            Number of atoms       :   13 (   1 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    7 (   5   ~;   2   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    6 (   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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn  16   !;   0   ?;   7   :)

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

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

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

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

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(f16,plain,
    ~ theorem(or(not(or(not(p),or(not(q),r))),or(not(q),or(not(p),r)))),
    inference(definition_unfolding,[],[f9,f6,f6,f6,f6,f6]) ).

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

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

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_123,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_65,c_109]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : LCL172-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.02  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.31  % Computer : n012.cluster.edu
% 0.03/0.31  % Model    : x86_64 x86_64
% 0.03/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.31  % Memory   : 8046.5625MB
% 0.03/0.31  % OS       : Linux 6.8.0-71-generic
% 0.03/0.31  % CPULimit : 300
% 0.03/0.31  % WCLimit  : 300
% 0.03/0.31  % DateTime : Wed Sep 23 22:09:24 UTC 2026
% 0.03/0.31  % CPUTime  : 
% 0.03/0.31  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.07/0.33  Running first-order theorem proving
% 0.07/0.33  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.07/0.33  
% 0.07/0.33  % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.33  
% 0.07/0.33  % Detected problem language: tptp
% 0.07/0.34  % Proving...
% 1.13/1.07  % SZS status Started for theBenchmark.p
% 1.13/1.07  % SZS status Unsatisfiable for theBenchmark.p
% 1.13/1.07  
% 1.13/1.07  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.13/1.07  
% 1.13/1.07  % ------  iProver source info
% 1.13/1.07  
% 1.13/1.07  % git: date: 2026-07-19 20:42:38 +0200
% 1.13/1.07  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.13/1.07  % git: non_committed_changes: false
% 1.13/1.07  
% 1.13/1.07  % ------ Parsing...% successful
% 1.13/1.07  
% 1.13/1.07  
% 1.13/1.07  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.13/1.07  
% 1.13/1.07  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe:1:0s% 
% 1.13/1.07  
% 1.13/1.07  % SZS status Unsatisfiable for theBenchmark.p
% 1.13/1.07  
% 1.13/1.07  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.13/1.07  
% 1.13/1.07  
%------------------------------------------------------------------------------