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

View Problem - Process Solution

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

% Computer : n023.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 : Mon Jun 24 11:04:11 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    ( ~ is_a_theorem(equivalent(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(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X0)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_1) ).

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

cnf(c_52,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_q_2) ).

cnf(c_59,plain,
    equivalent(a,b) = sP0_iProver_def,
    definition ).

cnf(c_60,plain,
    equivalent(c,a) = sP1_iProver_def,
    definition ).

cnf(c_61,plain,
    equivalent(c,b) = sP2_iProver_def,
    definition ).

cnf(c_62,plain,
    equivalent(sP1_iProver_def,sP2_iProver_def) = sP3_iProver_def,
    definition ).

cnf(c_63,plain,
    equivalent(sP0_iProver_def,sP3_iProver_def) = sP4_iProver_def,
    definition ).

cnf(c_64,negated_conjecture,
    ~ is_a_theorem(sP4_iProver_def),
    inference(demodulation,[status(thm)],[c_52,c_61,c_60,c_62,c_59,c_63]) ).

cnf(c_117,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X0,c),equivalent(X0,b)),sP2_iProver_def)),
    inference(superposition,[status(thm)],[c_61,c_51]) ).

cnf(c_119,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X0,sP0_iProver_def),equivalent(X0,sP3_iProver_def)),sP4_iProver_def)),
    inference(superposition,[status(thm)],[c_63,c_51]) ).

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

cnf(c_145,plain,
    is_a_theorem(equivalent(X0,equivalent(equivalent(a,c),equivalent(sP1_iProver_def,X0)))),
    inference(superposition,[status(thm)],[c_60,c_50]) ).

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

cnf(c_176,plain,
    ( ~ is_a_theorem(equivalent(equivalent(X0,sP0_iProver_def),equivalent(X0,sP3_iProver_def)))
    | is_a_theorem(sP4_iProver_def) ),
    inference(superposition,[status(thm)],[c_119,c_49]) ).

cnf(c_185,plain,
    is_a_theorem(equivalent(equivalent(equivalent(a,c),sP0_iProver_def),sP2_iProver_def)),
    inference(superposition,[status(thm)],[c_59,c_117]) ).

cnf(c_296,plain,
    is_a_theorem(equivalent(sP2_iProver_def,equivalent(equivalent(a,c),sP3_iProver_def))),
    inference(superposition,[status(thm)],[c_62,c_145]) ).

cnf(c_345,plain,
    ( ~ is_a_theorem(equivalent(X0,X1))
    | ~ is_a_theorem(X2)
    | is_a_theorem(equivalent(equivalent(X1,X0),X2)) ),
    inference(superposition,[status(thm)],[c_149,c_49]) ).

cnf(c_356,plain,
    ~ is_a_theorem(equivalent(equivalent(X0,sP0_iProver_def),equivalent(X0,sP3_iProver_def))),
    inference(global_subsumption_just,[status(thm)],[c_176,c_64,c_176]) ).

cnf(c_598,plain,
    ( ~ is_a_theorem(equivalent(X0,X1))
    | ~ is_a_theorem(equivalent(X1,X2))
    | is_a_theorem(equivalent(X0,X2)) ),
    inference(superposition,[status(thm)],[c_345,c_120]) ).

cnf(c_1462,plain,
    ( ~ is_a_theorem(equivalent(sP2_iProver_def,X0))
    | is_a_theorem(equivalent(equivalent(equivalent(a,c),sP0_iProver_def),X0)) ),
    inference(superposition,[status(thm)],[c_185,c_598]) ).

cnf(c_5621,plain,
    ~ is_a_theorem(equivalent(sP2_iProver_def,equivalent(equivalent(a,c),sP3_iProver_def))),
    inference(superposition,[status(thm)],[c_1462,c_356]) ).

cnf(c_5704,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_5621,c_296]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL106-1 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n023.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 : Sat Jun 22 16:32:09 EDT 2024
% 0.12/0.34  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/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
% 4.06/1.16  % SZS status Started for theBenchmark.p
% 4.06/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 4.06/1.16  
% 4.06/1.16  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.06/1.16  
% 4.06/1.16  ------  iProver source info
% 4.06/1.16  
% 4.06/1.16  git: date: 2024-06-12 09:56:46 +0000
% 4.06/1.16  git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 4.06/1.16  git: non_committed_changes: false
% 4.06/1.16  
% 4.06/1.16  ------ Parsing...successful
% 4.06/1.16  
% 4.06/1.16  
% 4.06/1.16  
% 4.06/1.16  ------ Preprocessing... pe_s  pe_e 
% 4.06/1.16  
% 4.06/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  scvd_s sp: 0 0s scvd_e  snvd_s sp: 0 0s snvd_e 
% 4.06/1.16  
% 4.06/1.16  ------ Preprocessing...
% 4.06/1.16  ------ Proving...
% 4.06/1.16  ------ Problem Properties 
% 4.06/1.16  
% 4.06/1.16  
% 4.06/1.16  clauses                                 9
% 4.06/1.16  conjectures                             1
% 4.06/1.16  EPR                                     1
% 4.06/1.16  Horn                                    9
% 4.06/1.16  unary                                   8
% 4.06/1.16  binary                                  0
% 4.06/1.16  lits                                    11
% 4.06/1.16  lits eq                                 5
% 4.06/1.16  fd_pure                                 0
% 4.06/1.16  fd_pseudo                               0
% 4.06/1.16  fd_cond                                 0
% 4.06/1.16  fd_pseudo_cond                          0
% 4.06/1.16  AC symbols                              0
% 4.06/1.16  
% 4.06/1.16  ------ Input Options Time Limit: Unbounded
% 4.06/1.16  
% 4.06/1.16  
% 4.06/1.16  ------ 
% 4.06/1.16  Current options:
% 4.06/1.16  ------ 
% 4.06/1.16  
% 4.06/1.16  
% 4.06/1.16  
% 4.06/1.16  
% 4.06/1.16  ------ Proving...
% 4.06/1.16  
% 4.06/1.16  
% 4.06/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 4.06/1.16  
% 4.06/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.06/1.16  
% 4.06/1.16  
%------------------------------------------------------------------------------