↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n019.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:06:40 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1446,axiom,
    ! [X2,X3,X0,X1] :
      ( c_in(c_PropLog_Opl_Oop_A_N_62(X1,X0,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
      | ~ c_in(X0,c_PropLog_Othms(c_insert(X1,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Odeduction_0) ).

fof(f1447,axiom,
    ! [X2,X3,X0,X1] :
      ( c_in(X3,c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2))
      | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X0,X3,X2),c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2))
      | ~ c_in(X0,c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms_OMP_0) ).

fof(f1449,axiom,
    ! [X2,X3,X0,X1] : c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X0,X1,X2),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X0,c_PropLog_Opl_Ofalse,X2),X1,X2),X1,X2),X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms__excluded__middle_0) ).

fof(f1450,negated_conjecture,
    c_in(v_q,c_PropLog_Othms(c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f1451,negated_conjecture,
    c_in(v_q,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f1452,negated_conjecture,
    ~ c_in(v_q,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

tcf(c_2024,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_in(c_PropLog_Opl_Oop_A_N_62(X1,X0,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
      | ~ c_in(X0,c_PropLog_Othms(c_insert(X1,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
    inference(cnf_transformation,[],[f1446]) ).

tcf(c_2025,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_in(X1,c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2))
      | ~ c_in(X0,c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2))
      | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X0,X1,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)) ),
    inference(cnf_transformation,[],[f1447]) ).

tcf(c_2027,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X0,X1,X2),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X0,c_PropLog_Opl_Ofalse,X2),X1,X2),X1,X2),X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)),
    inference(cnf_transformation,[],[f1449]) ).

tcf(c_2028,negated_conjecture,
    c_in(v_q,c_PropLog_Othms(c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
    inference(cnf_transformation,[],[f1450]) ).

tcf(c_2029,negated_conjecture,
    c_in(v_q,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
    inference(cnf_transformation,[],[f1451]) ).

tcf(c_2030,negated_conjecture,
    ~ c_in(v_q,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    inference(cnf_transformation,[],[f1452]) ).

tcf(c_2159,plain,
    c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    inference(superposition,[status(thm)],[c_2028,c_2024]) ).

tcf(c_2160,plain,
    c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    inference(superposition,[status(thm)],[c_2029,c_2024]) ).

tcf(c_2181,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X0,c_PropLog_Opl_Ofalse,X2),X1,X2),X1,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2))
      | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X0,X1,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)) ),
    inference(superposition,[status(thm)],[c_2027,c_2025]) ).

tcf(c_2318,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_in(X2,c_PropLog_Othms(X3,X1),tc_PropLog_Opl(X1))
      | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X0,X2,X1),c_PropLog_Othms(X3,X1),tc_PropLog_Opl(X1))
      | ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X0,c_PropLog_Opl_Ofalse,X1),X2,X1),c_PropLog_Othms(X3,X1),tc_PropLog_Opl(X1)) ),
    inference(superposition,[status(thm)],[c_2181,c_2025]) ).

tcf(c_2839,plain,
    ( c_in(v_q,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ),
    inference(superposition,[status(thm)],[c_2160,c_2318]) ).

tcf(c_2846,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_2839,c_2159,c_2030]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL445-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.58  % Computer : n019.cluster.edu
% 0.10/0.58  % Model    : x86_64 x86_64
% 0.10/0.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.58  % Memory   : 8046.5625MB
% 0.10/0.58  % OS       : Linux 6.8.0-71-generic
% 0.10/0.58  % CPULimit : 300
% 0.10/0.58  % WCLimit  : 300
% 0.10/0.58  % DateTime : Wed Sep 23 23:24:51 UTC 2026
% 0.10/0.59  % CPUTime  : 
% 0.10/0.59  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.62  Running first-order theorem proving
% 0.10/0.62  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.14/0.63  
% 0.14/0.63  % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.63  
% 0.14/0.63  % Detected problem language: tptp
% 0.14/0.64  % Proving...
% 0.75/1.41  % SZS status Started for theBenchmark.p
% 0.75/1.41  % SZS status Unsatisfiable for theBenchmark.p
% 0.75/1.41  
% 0.75/1.41  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.75/1.41  
% 0.75/1.41  % ------  iProver source info
% 0.75/1.41  
% 0.75/1.41  % git: date: 2026-07-19 20:42:38 +0200
% 0.75/1.41  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.75/1.41  % git: non_committed_changes: false
% 0.75/1.41  
% 0.75/1.41  % ------ Parsing...% successful
% 0.75/1.41  
% 0.75/1.41  
% 0.75/1.41  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.75/1.41  % ------ Proving...
% 0.75/1.41  % ------ Problem Properties 
% 0.75/1.41  
% 0.75/1.41  % 
% 0.75/1.41  % clauses                               608
% 0.75/1.41  % conjectures                           3
% 0.75/1.41  % EPR                                   289
% 0.75/1.41  % Horn                                  580
% 0.75/1.41  % unary                                 154
% 0.75/1.41  % binary                                392
% 0.75/1.41  % lits                                  1124
% 0.75/1.41  % lits eq                               204
% 0.75/1.41  % fd_pure                               0
% 0.75/1.41  % fd_pseudo                             0
% 0.75/1.41  % fd_cond                               28
% 0.75/1.41  % fd_pseudo_cond                        41
% 0.75/1.41  % AC symbols                            0
% 0.75/1.41  
% 0.75/1.41  % ------ Input Options Time Limit: Unbounded
% 0.75/1.41  
% 0.75/1.41  
% 0.75/1.41  % ------ 
% 0.75/1.41  % Current options:
% 0.75/1.41  % ------ 
% 0.75/1.41  
% 0.75/1.41  
% 0.75/1.41  % 
% 0.75/1.41  
% 0.75/1.41  % ------ Proving...
% 0.75/1.41  % 
% 0.75/1.41  
% 0.75/1.41  % SZS status Unsatisfiable for theBenchmark.p
% 0.75/1.41  
% 0.75/1.41  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.75/1.41  
% 0.75/1.41  
%------------------------------------------------------------------------------