TSTP Solution File: LCL069-1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : LCL069-1 : TPTP v8.1.2. Bugfixed v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n027.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 : Thu Aug 31 07:42:18 EDT 2023

% Result   : Unsatisfiable 10.00s 2.16s
% Output   : CNFRefutation 10.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   42 (  20 unt;   0 nHn;  25 RR)
%            Number of literals    :   80 (   0 equ;  40 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   89 (  23 sgn)

% 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(implies(implies(X0,X1),X2),implies(X1,X2))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_19) ).

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

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

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

cnf(c_54,plain,
    is_a_theorem(implies(implies(implies(a,a),a),implies(a,a))),
    inference(instantiation,[status(thm)],[c_50]) ).

cnf(c_79,plain,
    ( ~ is_a_theorem(implies(implies(implies(implies(X0,X1),X2),implies(X1,X2)),X3))
    | ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2)))
    | is_a_theorem(X3) ),
    inference(instantiation,[status(thm)],[c_49]) ).

cnf(c_85,plain,
    ( ~ is_a_theorem(implies(implies(implies(implies(X0,X1),X2),implies(X1,X2)),implies(X2,implies(X1,X2))))
    | ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2)))
    | is_a_theorem(implies(X2,implies(X1,X2))) ),
    inference(instantiation,[status(thm)],[c_79]) ).

cnf(c_86,plain,
    ( ~ is_a_theorem(implies(implies(implies(implies(a,a),a),implies(a,a)),implies(a,implies(a,a))))
    | ~ is_a_theorem(implies(implies(implies(a,a),a),implies(a,a)))
    | is_a_theorem(implies(a,implies(a,a))) ),
    inference(instantiation,[status(thm)],[c_85]) ).

cnf(c_97,plain,
    is_a_theorem(implies(implies(implies(implies(X0,X1),X2),implies(X1,X2)),implies(X2,implies(X1,X2)))),
    inference(instantiation,[status(thm)],[c_50]) ).

cnf(c_98,plain,
    is_a_theorem(implies(implies(implies(implies(a,a),a),implies(a,a)),implies(a,implies(a,a)))),
    inference(instantiation,[status(thm)],[c_97]) ).

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

cnf(c_132,plain,
    is_a_theorem(implies(X0,implies(X1,X0))),
    inference(superposition,[status(thm)],[c_50,c_118]) ).

cnf(c_177,plain,
    is_a_theorem(implies(X0,implies(X1,implies(X2,X0)))),
    inference(superposition,[status(thm)],[c_132,c_118]) ).

cnf(c_179,plain,
    is_a_theorem(implies(a,implies(a,implies(a,a)))),
    inference(instantiation,[status(thm)],[c_177]) ).

cnf(c_202,plain,
    ( ~ is_a_theorem(implies(implies(X0,X1),X2))
    | is_a_theorem(implies(X1,X2)) ),
    inference(resolution,[status(thm)],[c_49,c_50]) ).

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

cnf(c_257,plain,
    is_a_theorem(implies(X0,implies(X1,X0))),
    inference(resolution,[status(thm)],[c_202,c_50]) ).

cnf(c_671,plain,
    ( ~ is_a_theorem(implies(not(X0),X1))
    | is_a_theorem(implies(implies(X2,X1),implies(implies(X0,X2),X1))) ),
    inference(resolution,[status(thm)],[c_52,c_49]) ).

cnf(c_745,plain,
    is_a_theorem(implies(not(implies(X0,X1)),implies(X1,X2))),
    inference(resolution,[status(thm)],[c_223,c_50]) ).

cnf(c_748,plain,
    is_a_theorem(implies(not(X0),implies(X1,implies(X0,X2)))),
    inference(resolution,[status(thm)],[c_223,c_257]) ).

cnf(c_1139,plain,
    ( ~ is_a_theorem(implies(not(X0),X1))
    | ~ is_a_theorem(implies(X2,X1))
    | is_a_theorem(implies(implies(X0,X2),X1)) ),
    inference(resolution,[status(thm)],[c_671,c_49]) ).

cnf(c_1640,plain,
    ( ~ is_a_theorem(implies(not(X0),X1))
    | ~ is_a_theorem(implies(X0,X2))
    | ~ is_a_theorem(implies(X2,X1))
    | is_a_theorem(X1) ),
    inference(resolution,[status(thm)],[c_1139,c_49]) ).

cnf(c_2240,plain,
    ( ~ is_a_theorem(implies(implies(X0,X1),X2))
    | ~ is_a_theorem(implies(X2,implies(X1,X3)))
    | is_a_theorem(implies(X1,X3)) ),
    inference(resolution,[status(thm)],[c_1640,c_745]) ).

cnf(c_2243,plain,
    ( ~ is_a_theorem(implies(X0,implies(X1,not(X2))))
    | ~ is_a_theorem(implies(X2,X0))
    | is_a_theorem(implies(X1,not(X2))) ),
    inference(resolution,[status(thm)],[c_1640,c_257]) ).

cnf(c_2256,plain,
    ( ~ is_a_theorem(implies(X0,implies(X1,implies(X2,X3))))
    | ~ is_a_theorem(implies(X2,X0))
    | is_a_theorem(implies(X1,implies(X2,X3))) ),
    inference(resolution,[status(thm)],[c_1640,c_748]) ).

cnf(c_3191,plain,
    ( ~ is_a_theorem(implies(implies(X0,X1),implies(X2,X3)))
    | ~ is_a_theorem(implies(not(X2),implies(X1,X4)))
    | ~ is_a_theorem(implies(X3,implies(X1,X4)))
    | is_a_theorem(implies(X1,X4)) ),
    inference(resolution,[status(thm)],[c_2240,c_1139]) ).

cnf(c_3192,plain,
    ( ~ is_a_theorem(implies(implies(a,a),implies(a,a)))
    | ~ is_a_theorem(implies(not(a),implies(a,a)))
    | ~ is_a_theorem(implies(a,implies(a,a)))
    | is_a_theorem(implies(a,a)) ),
    inference(instantiation,[status(thm)],[c_3191]) ).

cnf(c_6167,plain,
    ( ~ is_a_theorem(implies(X0,implies(X0,X1)))
    | is_a_theorem(implies(X2,implies(X0,X1))) ),
    inference(resolution,[status(thm)],[c_2256,c_257]) ).

cnf(c_6171,plain,
    ( ~ is_a_theorem(implies(X0,implies(X1,implies(X0,X2))))
    | ~ is_a_theorem(implies(not(X3),implies(X0,X2)))
    | is_a_theorem(implies(implies(X3,X1),implies(X0,X2))) ),
    inference(resolution,[status(thm)],[c_2256,c_671]) ).

cnf(c_6172,plain,
    ( ~ is_a_theorem(implies(a,implies(a,implies(a,a))))
    | ~ is_a_theorem(implies(not(a),implies(a,a)))
    | is_a_theorem(implies(implies(a,a),implies(a,a))) ),
    inference(instantiation,[status(thm)],[c_6171]) ).

cnf(c_8389,plain,
    is_a_theorem(implies(X0,implies(X1,X1))),
    inference(resolution,[status(thm)],[c_6167,c_257]) ).

cnf(c_10246,plain,
    ( ~ is_a_theorem(X0)
    | is_a_theorem(implies(X1,X1)) ),
    inference(resolution,[status(thm)],[c_8389,c_49]) ).

cnf(c_10248,plain,
    is_a_theorem(implies(not(X0),implies(X1,X1))),
    inference(resolution,[status(thm)],[c_8389,c_223]) ).

cnf(c_10250,plain,
    is_a_theorem(implies(not(a),implies(a,a))),
    inference(instantiation,[status(thm)],[c_10248]) ).

cnf(c_10255,plain,
    ( ~ is_a_theorem(implies(X0,X1))
    | is_a_theorem(implies(not(X0),not(X0))) ),
    inference(resolution,[status(thm)],[c_8389,c_2243]) ).

cnf(c_10256,plain,
    ( ~ is_a_theorem(implies(a,a))
    | is_a_theorem(implies(not(a),not(a))) ),
    inference(instantiation,[status(thm)],[c_10255]) ).

cnf(c_10799,plain,
    is_a_theorem(implies(X0,X0)),
    inference(resolution,[status(thm)],[c_10246,c_50]) ).

cnf(c_10831,plain,
    is_a_theorem(implies(not(X0),implies(X0,X1))),
    inference(resolution,[status(thm)],[c_10799,c_223]) ).

cnf(c_10974,plain,
    ( ~ is_a_theorem(implies(X0,not(X1)))
    | is_a_theorem(implies(X1,implies(X0,X2))) ),
    inference(resolution,[status(thm)],[c_10831,c_2256]) ).

cnf(c_32719,plain,
    ~ is_a_theorem(implies(not(a),not(a))),
    inference(resolution,[status(thm)],[c_10974,c_53]) ).

cnf(c_32720,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_32719,c_10256,c_10250,c_6172,c_3192,c_179,c_98,c_86,c_54]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL069-1 : TPTP v8.1.2. Bugfixed v1.2.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n027.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 Aug 24 19:11:33 EDT 2023
% 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 --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 10.00/2.16  % SZS status Started for theBenchmark.p
% 10.00/2.16  % SZS status Unsatisfiable for theBenchmark.p
% 10.00/2.16  
% 10.00/2.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 10.00/2.16  
% 10.00/2.16  ------  iProver source info
% 10.00/2.16  
% 10.00/2.16  git: date: 2023-05-31 18:12:56 +0000
% 10.00/2.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 10.00/2.16  git: non_committed_changes: false
% 10.00/2.16  git: last_make_outside_of_git: false
% 10.00/2.16  
% 10.00/2.16  ------ Parsing...successful
% 10.00/2.16  
% 10.00/2.16  
% 10.00/2.16  
% 10.00/2.16  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 10.00/2.16  
% 10.00/2.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 10.00/2.16  ------ Proving...
% 10.00/2.16  ------ Problem Properties 
% 10.00/2.16  
% 10.00/2.16  
% 10.00/2.16  clauses                                 5
% 10.00/2.16  conjectures                             1
% 10.00/2.16  EPR                                     0
% 10.00/2.16  Horn                                    5
% 10.00/2.16  unary                                   4
% 10.00/2.16  binary                                  0
% 10.00/2.16  lits                                    7
% 10.00/2.16  lits eq                                 0
% 10.00/2.16  fd_pure                                 0
% 10.00/2.16  fd_pseudo                               0
% 10.00/2.16  fd_cond                                 0
% 10.00/2.16  fd_pseudo_cond                          0
% 10.00/2.16  AC symbols                              0
% 10.00/2.16  
% 10.00/2.16  ------ Input Options Time Limit: Unbounded
% 10.00/2.16  
% 10.00/2.16  
% 10.00/2.16  ------ 
% 10.00/2.16  Current options:
% 10.00/2.16  ------ 
% 10.00/2.16  
% 10.00/2.16  
% 10.00/2.16  
% 10.00/2.16  
% 10.00/2.16  ------ Proving...
% 10.00/2.16  
% 10.00/2.16  
% 10.00/2.16  % SZS status Unsatisfiable for theBenchmark.p
% 10.00/2.16  
% 10.00/2.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.00/2.16  
% 10.00/2.16  
%------------------------------------------------------------------------------