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

View Problem - Process Solution

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

% Computer : n008.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:44 EDT 2023

% Result   : Satisfiable 213.56s 29.34s
% Output   : Saturation 213.56s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
    big_hat(big_V(x,z),big_V(y,z)) != big_V(big_hat(x,y),z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_wajsberg_theorem) ).

cnf(c_50,plain,
    implies(implies(X0,X1),X1) = big_V(X0,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-1.ax',big_V_definition) ).

cnf(c_51,plain,
    not(big_V(not(X0),not(X1))) = big_hat(X0,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-1.ax',big_hat_definition) ).

cnf(c_54,plain,
    implies(truth,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).

cnf(c_55,plain,
    implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = truth,
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).

cnf(c_56,plain,
    implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).

cnf(c_57,plain,
    implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).

cnf(c_104,plain,
    implies(implies(X0,X1),X1) = big_V(X1,X0),
    inference(light_normalisation,[status(thm)],[c_56,c_50]) ).

cnf(c_105,plain,
    big_V(X0,X1) = big_V(X1,X0),
    inference(light_normalisation,[status(thm)],[c_104,c_50]) ).

cnf(c_106,plain,
    big_hat(big_V(z,x),big_V(z,y)) != big_V(z,big_hat(x,y)),
    inference(demodulation,[status(thm)],[c_49,c_105]) ).

cnf(c_108,plain,
    X0_1 = X0_1,
    theory(equality) ).

cnf(c_2057,plain,
    implies(X0,X0) = big_V(truth,X0),
    inference(superposition,[status(thm)],[c_54,c_50]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : LCL151-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n008.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 Aug 24 21:43:48 EDT 2023
% 0.13/0.35  % 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 --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 213.56/29.34  % SZS status Started for theBenchmark.p
% 213.56/29.34  % SZS status Satisfiable for theBenchmark.p
% 213.56/29.34  
% 213.56/29.34  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 213.56/29.34  
% 213.56/29.34  ------  iProver source info
% 213.56/29.34  
% 213.56/29.34  git: date: 2023-05-31 18:12:56 +0000
% 213.56/29.34  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 213.56/29.34  git: non_committed_changes: false
% 213.56/29.34  git: last_make_outside_of_git: false
% 213.56/29.34  
% 213.56/29.34  ------ Parsing...successful
% 213.56/29.34  
% 213.56/29.34  
% 213.56/29.34  
% 213.56/29.34  ------ Preprocessing... sup_sim: 2  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 213.56/29.34  
% 213.56/29.34  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 213.56/29.34  
% 213.56/29.34  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 213.56/29.34  ------ Proving...
% 213.56/29.34  ------ Problem Properties 
% 213.56/29.34  
% 213.56/29.34  
% 213.56/29.34  clauses                                 7
% 213.56/29.34  conjectures                             0
% 213.56/29.34  EPR                                     0
% 213.56/29.34  Horn                                    7
% 213.56/29.34  unary                                   7
% 213.56/29.34  binary                                  0
% 213.56/29.34  lits                                    7
% 213.56/29.34  lits eq                                 7
% 213.56/29.34  fd_pure                                 0
% 213.56/29.34  fd_pseudo                               0
% 213.56/29.34  fd_cond                                 0
% 213.56/29.34  fd_pseudo_cond                          0
% 213.56/29.34  AC symbols                              0
% 213.56/29.34  
% 213.56/29.34  ------ Input Options Time Limit: Unbounded
% 213.56/29.34  
% 213.56/29.34  
% 213.56/29.34  ------ 
% 213.56/29.34  Current options:
% 213.56/29.34  ------ 
% 213.56/29.34  
% 213.56/29.34  
% 213.56/29.34  
% 213.56/29.34  
% 213.56/29.34  ------ Proving...
% 213.56/29.34  
% 213.56/29.34  
% 213.56/29.34  % SZS status Satisfiable for theBenchmark.p
% 213.56/29.34  
% 213.56/29.34  % SZS output start Saturation for theBenchmark.p
% See solution above
% 213.56/29.34  
% 213.56/29.34  
%------------------------------------------------------------------------------