TSTP Solution File: COM009-2 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : COM009-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n028.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri May  3 02:10:25 EDT 2024

% Result   : Unsatisfiable 0.73s 1.18s
% Output   : CNFRefutation 0.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   15 (   6 unt;   3 nHn;  14 RR)
%            Number of literals    :   24 (  13 equ;  13 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :    9 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
    ( c_UNITY_Ototalize(v_F,t_a) != v_F
    | ~ c_UNITY_Oall__total(v_F,t_a) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(c_50,negated_conjecture,
    ( c_UNITY_Ototalize(v_F,t_a) = v_F
    | c_UNITY_Oall__total(v_F,t_a) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(c_51,plain,
    ( ~ c_UNITY_Oall__total(X0,X1)
    | c_UNITY_Ototalize(X0,X1) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_UNITY_Oall__total__imp__totalize_0) ).

cnf(c_52,plain,
    c_UNITY_Oall__total(c_UNITY_Ototalize(X0,X1),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_UNITY_Oall__total__totalize_0) ).

cnf(c_55,plain,
    ( ~ c_UNITY_Oall__total(v_F,t_a)
    | c_UNITY_Ototalize(v_F,t_a) != v_F ),
    inference(prop_impl_just,[status(thm)],[c_49]) ).

cnf(c_56,plain,
    ( c_UNITY_Ototalize(v_F,t_a) != v_F
    | ~ c_UNITY_Oall__total(v_F,t_a) ),
    inference(renaming,[status(thm)],[c_55]) ).

cnf(c_57,plain,
    ( c_UNITY_Oall__total(v_F,t_a)
    | c_UNITY_Ototalize(v_F,t_a) = v_F ),
    inference(prop_impl_just,[status(thm)],[c_50]) ).

cnf(c_58,plain,
    ( c_UNITY_Ototalize(v_F,t_a) = v_F
    | c_UNITY_Oall__total(v_F,t_a) ),
    inference(renaming,[status(thm)],[c_57]) ).

cnf(c_59,plain,
    ( ~ c_UNITY_Oall__total(X0,X1)
    | c_UNITY_Ototalize(X0,X1) = X0 ),
    inference(prop_impl_just,[status(thm)],[c_51]) ).

cnf(c_76,plain,
    c_UNITY_Ototalize(v_F,t_a) = v_F,
    inference(forward_subsumption_resolution,[status(thm)],[c_58,c_59]) ).

cnf(c_80,plain,
    ~ c_UNITY_Oall__total(v_F,t_a),
    inference(backward_subsumption_resolution,[status(thm)],[c_56,c_76]) ).

cnf(c_94,plain,
    ( c_UNITY_Ototalize(X0,X1) != v_F
    | X1 != t_a ),
    inference(resolution_lifted,[status(thm)],[c_80,c_52]) ).

cnf(c_95,plain,
    c_UNITY_Ototalize(X0,t_a) != v_F,
    inference(unflattening,[status(thm)],[c_94]) ).

cnf(c_96,plain,
    c_UNITY_Ototalize(v_F,t_a) != v_F,
    inference(instantiation,[status(thm)],[c_95]) ).

cnf(c_97,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_96,c_76]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : COM009-2 : TPTP v8.1.2. Released v3.2.0.
% 0.04/0.13  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n028.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Fri May  3 01:00:18 EDT 2024
% 0.12/0.34  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.73/1.18  % SZS status Started for theBenchmark.p
% 0.73/1.18  % SZS status Unsatisfiable for theBenchmark.p
% 0.73/1.18  
% 0.73/1.18  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.73/1.18  
% 0.73/1.18  ------  iProver source info
% 0.73/1.18  
% 0.73/1.18  git: date: 2024-05-02 19:28:25 +0000
% 0.73/1.18  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.73/1.18  git: non_committed_changes: false
% 0.73/1.18  
% 0.73/1.18  ------ Parsing...successful
% 0.73/1.18  
% 0.73/1.18  
% 0.73/1.18  
% 0.73/1.18  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s 
% 0.73/1.18  
% 0.73/1.18  % SZS status Unsatisfiable for theBenchmark.p
% 0.73/1.18  
% 0.73/1.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.73/1.18  
% 0.73/1.18  
%------------------------------------------------------------------------------