TSTP Solution File: LCL076-1 by iProver---3.9

View Problem - Process Solution

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

% Computer : n004.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:36:45 EDT 2024

% Result   : Unsatisfiable 3.98s 1.20s
% Output   : CNFRefutation 3.98s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named definition)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    ( ~ is_a_theorem(implies(X0,X1))
    | ~ is_a_theorem(X0)
    | is_a_theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(c_50,plain,
    is_a_theorem(implies(X0,implies(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18) ).

cnf(c_51,plain,
    is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_35) ).

cnf(c_52,plain,
    is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_49) ).

cnf(c_53,negated_conjecture,
    ~ is_a_theorem(implies(a,not(not(a)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_40) ).

cnf(c_71,plain,
    not(a) = sP0_iProver_def,
    definition ).

cnf(c_72,plain,
    not(sP0_iProver_def) = sP1_iProver_def,
    definition ).

cnf(c_73,plain,
    implies(a,sP1_iProver_def) = sP2_iProver_def,
    definition ).

cnf(c_74,negated_conjecture,
    ~ is_a_theorem(sP2_iProver_def),
    inference(demodulation,[status(thm)],[c_53,c_71,c_72,c_73]) ).

cnf(c_179,plain,
    ( ~ is_a_theorem(X0)
    | is_a_theorem(implies(X1,X0)) ),
    inference(superposition,[status(thm)],[c_50,c_49]) ).

cnf(c_196,plain,
    is_a_theorem(implies(implies(not(sP1_iProver_def),not(a)),sP2_iProver_def)),
    inference(superposition,[status(thm)],[c_73,c_52]) ).

cnf(c_198,plain,
    is_a_theorem(implies(implies(not(sP1_iProver_def),sP0_iProver_def),sP2_iProver_def)),
    inference(light_normalisation,[status(thm)],[c_196,c_71]) ).

cnf(c_209,plain,
    ( ~ is_a_theorem(implies(X0,implies(X1,X2)))
    | is_a_theorem(implies(implies(X0,X1),implies(X0,X2))) ),
    inference(superposition,[status(thm)],[c_51,c_49]) ).

cnf(c_216,plain,
    ( ~ is_a_theorem(implies(not(sP1_iProver_def),sP0_iProver_def))
    | is_a_theorem(sP2_iProver_def) ),
    inference(superposition,[status(thm)],[c_198,c_49]) ).

cnf(c_217,plain,
    ~ is_a_theorem(implies(not(sP1_iProver_def),sP0_iProver_def)),
    inference(forward_subsumption_resolution,[status(thm)],[c_216,c_74]) ).

cnf(c_603,plain,
    ( ~ is_a_theorem(implies(X0,implies(X1,X2)))
    | ~ is_a_theorem(implies(X0,X1))
    | is_a_theorem(implies(X0,X2)) ),
    inference(superposition,[status(thm)],[c_209,c_49]) ).

cnf(c_632,plain,
    ( ~ is_a_theorem(implies(X0,X1))
    | ~ is_a_theorem(implies(X2,X0))
    | is_a_theorem(implies(X2,X1)) ),
    inference(superposition,[status(thm)],[c_179,c_603]) ).

cnf(c_1094,plain,
    ( ~ is_a_theorem(implies(X0,implies(not(X1),not(X2))))
    | is_a_theorem(implies(X0,implies(X2,X1))) ),
    inference(superposition,[status(thm)],[c_52,c_632]) ).

cnf(c_1923,plain,
    is_a_theorem(implies(not(X0),implies(X0,X1))),
    inference(superposition,[status(thm)],[c_50,c_1094]) ).

cnf(c_2073,plain,
    is_a_theorem(implies(not(not(X0)),implies(X1,X0))),
    inference(superposition,[status(thm)],[c_1923,c_1094]) ).

cnf(c_2353,plain,
    is_a_theorem(implies(not(sP1_iProver_def),implies(X0,sP0_iProver_def))),
    inference(superposition,[status(thm)],[c_72,c_2073]) ).

cnf(c_2461,plain,
    ( ~ is_a_theorem(implies(not(sP1_iProver_def),X0))
    | is_a_theorem(implies(not(sP1_iProver_def),sP0_iProver_def)) ),
    inference(superposition,[status(thm)],[c_2353,c_603]) ).

cnf(c_2462,plain,
    ~ is_a_theorem(implies(not(sP1_iProver_def),X0)),
    inference(forward_subsumption_resolution,[status(thm)],[c_2461,c_217]) ).

cnf(c_2463,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_2353,c_2462]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : LCL076-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.14  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n004.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu May  2 18:58:03 EDT 2024
% 0.13/0.36  % CPUTime  : 
% 0.21/0.49  Running first-order theorem proving
% 0.21/0.49  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.98/1.20  % SZS status Started for theBenchmark.p
% 3.98/1.20  % SZS status Unsatisfiable for theBenchmark.p
% 3.98/1.20  
% 3.98/1.20  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.98/1.20  
% 3.98/1.20  ------  iProver source info
% 3.98/1.20  
% 3.98/1.20  git: date: 2024-05-02 19:28:25 +0000
% 3.98/1.20  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.98/1.20  git: non_committed_changes: false
% 3.98/1.20  
% 3.98/1.20  ------ Parsing...successful
% 3.98/1.20  
% 3.98/1.20  
% 3.98/1.20  
% 3.98/1.20  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 3.98/1.20  
% 3.98/1.20  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.98/1.20  
% 3.98/1.20  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.98/1.20  ------ Proving...
% 3.98/1.20  ------ Problem Properties 
% 3.98/1.20  
% 3.98/1.20  
% 3.98/1.20  clauses                                 8
% 3.98/1.20  conjectures                             1
% 3.98/1.20  EPR                                     1
% 3.98/1.20  Horn                                    8
% 3.98/1.20  unary                                   7
% 3.98/1.20  binary                                  0
% 3.98/1.20  lits                                    10
% 3.98/1.20  lits eq                                 3
% 3.98/1.20  fd_pure                                 0
% 3.98/1.20  fd_pseudo                               0
% 3.98/1.20  fd_cond                                 0
% 3.98/1.20  fd_pseudo_cond                          0
% 3.98/1.20  AC symbols                              0
% 3.98/1.20  
% 3.98/1.20  ------ Schedule dynamic 5 is on 
% 3.98/1.20  
% 3.98/1.20  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.98/1.20  
% 3.98/1.20  
% 3.98/1.20  ------ 
% 3.98/1.20  Current options:
% 3.98/1.20  ------ 
% 3.98/1.20  
% 3.98/1.20  
% 3.98/1.20  
% 3.98/1.20  
% 3.98/1.20  ------ Proving...
% 3.98/1.20  
% 3.98/1.20  
% 3.98/1.20  % SZS status Unsatisfiable for theBenchmark.p
% 3.98/1.20  
% 3.98/1.20  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.98/1.20  
% 3.98/1.20  
%------------------------------------------------------------------------------