TSTP Solution File: SYN002-1.007.008 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SYN002-1.007.008 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n020.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 03:28:33 EDT 2024

% Result   : Unsatisfiable 2.17s 1.16s
% Output   : CNFRefutation 2.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   27 (   5 unt;   7 nHn;  18 RR)
%            Number of literals    :   49 (   0 equ;  25 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    9 (   3 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :   26 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
    ( p(f(f(f(f(f(f(f(X0))))))))
    | p(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',positive) ).

cnf(c_50,negated_conjecture,
    ( ~ p(f(f(f(f(f(f(f(f(X0)))))))))
    | ~ p(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',negative) ).

cnf(c_61,negated_conjecture,
    ( ~ p(f(f(f(f(f(f(f(f(X0)))))))))
    | ~ p(X0) ),
    inference(demodulation,[status(thm)],[c_50]) ).

cnf(c_62,negated_conjecture,
    ( p(f(f(f(f(f(f(f(X0))))))))
    | p(X0) ),
    inference(demodulation,[status(thm)],[c_49]) ).

cnf(c_110,plain,
    ( ~ p(X0)
    | p(f(X0)) ),
    inference(superposition,[status(thm)],[c_62,c_61]) ).

cnf(c_118,plain,
    ( ~ p(X0)
    | p(f(X0)) ),
    inference(superposition,[status(thm)],[c_62,c_61]) ).

cnf(c_144,plain,
    ( ~ p(f(f(f(f(f(f(f(X0))))))))
    | ~ p(X0) ),
    inference(superposition,[status(thm)],[c_110,c_61]) ).

cnf(c_152,plain,
    ( ~ p(f(f(f(f(f(f(f(X0))))))))
    | ~ p(X0) ),
    inference(superposition,[status(thm)],[c_118,c_61]) ).

cnf(c_212,plain,
    ( ~ p(f(f(f(f(f(f(X0)))))))
    | ~ p(X0) ),
    inference(superposition,[status(thm)],[c_110,c_144]) ).

cnf(c_221,plain,
    ( ~ p(f(f(f(f(f(f(X0)))))))
    | ~ p(X0) ),
    inference(superposition,[status(thm)],[c_118,c_152]) ).

cnf(c_321,plain,
    ( ~ p(f(X0))
    | p(X0) ),
    inference(superposition,[status(thm)],[c_62,c_212]) ).

cnf(c_322,plain,
    ( ~ p(f(f(f(f(f(X0))))))
    | ~ p(X0) ),
    inference(superposition,[status(thm)],[c_110,c_212]) ).

cnf(c_333,plain,
    ( ~ p(f(X0))
    | p(X0) ),
    inference(superposition,[status(thm)],[c_62,c_221]) ).

cnf(c_334,plain,
    ( ~ p(f(f(f(f(f(X0))))))
    | ~ p(X0) ),
    inference(superposition,[status(thm)],[c_118,c_221]) ).

cnf(c_736,plain,
    ( p(f(f(f(f(f(f(X0)))))))
    | p(X0) ),
    inference(superposition,[status(thm)],[c_62,c_321]) ).

cnf(c_745,plain,
    ( p(f(f(f(f(f(f(X0)))))))
    | p(X0) ),
    inference(superposition,[status(thm)],[c_62,c_333]) ).

cnf(c_2389,plain,
    ( ~ p(f(f(X0)))
    | p(X0) ),
    inference(superposition,[status(thm)],[c_62,c_322]) ).

cnf(c_2403,plain,
    ( ~ p(f(f(X0)))
    | p(X0) ),
    inference(superposition,[status(thm)],[c_62,c_334]) ).

cnf(c_3201,plain,
    ( p(f(f(f(f(X0)))))
    | p(X0) ),
    inference(superposition,[status(thm)],[c_736,c_2389]) ).

cnf(c_3212,plain,
    ( p(f(f(f(f(X0)))))
    | p(X0) ),
    inference(superposition,[status(thm)],[c_745,c_2403]) ).

cnf(c_4133,plain,
    ( ~ p(X0)
    | p(f(f(f(X0)))) ),
    inference(superposition,[status(thm)],[c_3201,c_144]) ).

cnf(c_4135,plain,
    ( p(f(f(f(X0))))
    | p(X0) ),
    inference(superposition,[status(thm)],[c_3201,c_321]) ).

cnf(c_4145,plain,
    p(f(f(f(X0)))),
    inference(backward_subsumption_resolution,[status(thm)],[c_4135,c_4133]) ).

cnf(c_4146,plain,
    ~ p(X0),
    inference(backward_subsumption_resolution,[status(thm)],[c_322,c_4145]) ).

cnf(c_4152,plain,
    p(f(f(f(f(X0))))),
    inference(global_subsumption_just,[status(thm)],[c_3212,c_3201,c_4146]) ).

cnf(c_4158,plain,
    ~ p(X0),
    inference(backward_subsumption_resolution,[status(thm)],[c_61,c_4152]) ).

cnf(c_4159,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_4152,c_4158]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN002-1.007.008 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu May  2 20:51:31 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.19/0.47  Running first-order theorem proving
% 0.19/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
% 2.17/1.16  % SZS status Started for theBenchmark.p
% 2.17/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 2.17/1.16  
% 2.17/1.16  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.17/1.16  
% 2.17/1.16  ------  iProver source info
% 2.17/1.16  
% 2.17/1.16  git: date: 2024-05-02 19:28:25 +0000
% 2.17/1.16  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.17/1.16  git: non_committed_changes: false
% 2.17/1.16  
% 2.17/1.16  ------ Parsing...successful
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 2.17/1.16  
% 2.17/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.17/1.16  ------ Proving...
% 2.17/1.16  ------ Problem Properties 
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  clauses                                 2
% 2.17/1.16  conjectures                             2
% 2.17/1.16  EPR                                     0
% 2.17/1.16  Horn                                    1
% 2.17/1.16  unary                                   0
% 2.17/1.16  binary                                  2
% 2.17/1.16  lits                                    4
% 2.17/1.16  lits eq                                 0
% 2.17/1.16  fd_pure                                 0
% 2.17/1.16  fd_pseudo                               0
% 2.17/1.16  fd_cond                                 0
% 2.17/1.16  fd_pseudo_cond                          0
% 2.17/1.16  AC symbols                              0
% 2.17/1.16  
% 2.17/1.16  ------ Schedule dynamic 5 is on 
% 2.17/1.16  
% 2.17/1.16  ------ no equalities: superposition off 
% 2.17/1.16  
% 2.17/1.16  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  ------ 
% 2.17/1.16  Current options:
% 2.17/1.16  ------ 
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  ------ Proving...
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 2.17/1.16  
% 2.17/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.17/1.16  
% 2.17/1.16  
%------------------------------------------------------------------------------