↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : LCL173-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 : n013.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.61s 1.26s
% Output   : CNFRefutation 1.61s
% 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(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(f9,negated_conjecture,
    ~ theorem(implies(implies(q,r),implies(implies(p,q),implies(p,r)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

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

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

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

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

tcf(c_114,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_63,c_62]) ).

tcf(c_124,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_65,c_114]) ).


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