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

View Problem - Process Solution

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

% Computer : n013.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:46 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,plain,
    ( ~ is_a_theorem(implies(X0,X1))
    | ~ is_a_theorem(implies(X1,X2))
    | is_a_theorem(implies(X0,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity) ).

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

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

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

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

cnf(c_81,negated_conjecture,
    ~ is_a_theorem(sP2_iProver_def),
    inference(demodulation,[status(thm)],[c_54,c_78,c_79,c_80]) ).

cnf(c_210,plain,
    is_a_theorem(implies(implies(sP0_iProver_def,not(X0)),implies(X0,a))),
    inference(superposition,[status(thm)],[c_78,c_52]) ).

cnf(c_213,plain,
    is_a_theorem(implies(implies(not(X0),sP1_iProver_def),implies(sP0_iProver_def,X0))),
    inference(superposition,[status(thm)],[c_79,c_52]) ).

cnf(c_226,plain,
    is_a_theorem(implies(implies(sP1_iProver_def,implies(X0,a)),implies(implies(sP1_iProver_def,X0),sP2_iProver_def))),
    inference(superposition,[status(thm)],[c_80,c_51]) ).

cnf(c_240,plain,
    ( ~ is_a_theorem(implies(implies(X0,X1),X2))
    | is_a_theorem(implies(X1,X2)) ),
    inference(superposition,[status(thm)],[c_50,c_53]) ).

cnf(c_655,plain,
    is_a_theorem(implies(sP1_iProver_def,implies(sP0_iProver_def,X0))),
    inference(superposition,[status(thm)],[c_213,c_240]) ).

cnf(c_715,plain,
    ( ~ is_a_theorem(implies(implies(sP0_iProver_def,X0),X1))
    | is_a_theorem(implies(sP1_iProver_def,X1)) ),
    inference(superposition,[status(thm)],[c_655,c_53]) ).

cnf(c_957,plain,
    ( ~ is_a_theorem(implies(sP1_iProver_def,implies(X0,a)))
    | is_a_theorem(implies(implies(sP1_iProver_def,X0),sP2_iProver_def)) ),
    inference(superposition,[status(thm)],[c_226,c_49]) ).

cnf(c_958,plain,
    is_a_theorem(implies(implies(X0,a),implies(implies(sP1_iProver_def,X0),sP2_iProver_def))),
    inference(superposition,[status(thm)],[c_226,c_240]) ).

cnf(c_1208,plain,
    is_a_theorem(implies(sP1_iProver_def,implies(X0,a))),
    inference(superposition,[status(thm)],[c_210,c_715]) ).

cnf(c_1477,plain,
    ( ~ is_a_theorem(implies(X0,a))
    | is_a_theorem(implies(implies(sP1_iProver_def,X0),sP2_iProver_def)) ),
    inference(superposition,[status(thm)],[c_958,c_49]) ).

cnf(c_1763,plain,
    is_a_theorem(implies(implies(sP1_iProver_def,X0),sP2_iProver_def)),
    inference(global_subsumption_just,[status(thm)],[c_1477,c_957,c_1208]) ).

cnf(c_1769,plain,
    is_a_theorem(implies(X0,sP2_iProver_def)),
    inference(superposition,[status(thm)],[c_1763,c_240]) ).

cnf(c_1774,plain,
    ( ~ is_a_theorem(X0)
    | is_a_theorem(sP2_iProver_def) ),
    inference(superposition,[status(thm)],[c_1769,c_49]) ).

cnf(c_1785,plain,
    ~ is_a_theorem(X0),
    inference(forward_subsumption_resolution,[status(thm)],[c_1774,c_81]) ).

cnf(c_1786,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_1769,c_1785]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL077-2 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.12  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n013.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 19:07:34 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.19/0.47  Running first-order theorem proving
% 0.19/0.47  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                                 9
% 3.98/1.20  conjectures                             1
% 3.98/1.20  EPR                                     1
% 3.98/1.20  Horn                                    9
% 3.98/1.20  unary                                   7
% 3.98/1.20  binary                                  0
% 3.98/1.20  lits                                    13
% 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  
%------------------------------------------------------------------------------