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

View Problem - Process Solution

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

% Computer : n016.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:43:02 EDT 2024

% Result   : Unsatisfiable 3.82s 1.12s
% Output   : CNFRefutation 3.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   69 (  69 unt;   0 nHn;  55 RR)
%            Number of literals    :   69 (  68 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;  11 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    f(f(X0,X1),f(X0,X2)) = f(X0,f(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1) ).

cnf(c_50,plain,
    f(n1,n1) = n2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

cnf(c_51,plain,
    f(n2,n1) = n3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

cnf(c_52,plain,
    f(n2,n2) = u,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

cnf(c_53,plain,
    f(u,n1) = u1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

cnf(c_54,plain,
    f(u,n2) = u2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

cnf(c_55,plain,
    f(u,n3) = u3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).

cnf(c_56,plain,
    f(u,u) = uu,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).

cnf(c_57,plain,
    f(f(n3,n2),u2) = a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).

cnf(c_58,plain,
    f(u1,u3) = b,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).

cnf(c_59,plain,
    f(uu,uu) = v,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).

cnf(c_60,negated_conjecture,
    f(a,v) != f(b,v),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equation) ).

cnf(c_133,plain,
    f(n2,f(n1,X0)) = f(n1,f(n1,X0)),
    inference(superposition,[status(thm)],[c_50,c_49]) ).

cnf(c_134,plain,
    f(n2,f(n1,X0)) = f(n3,f(n2,X0)),
    inference(superposition,[status(thm)],[c_51,c_49]) ).

cnf(c_135,plain,
    f(n2,f(n2,X0)) = f(u,f(n2,X0)),
    inference(superposition,[status(thm)],[c_52,c_49]) ).

cnf(c_136,plain,
    f(u,f(n1,X0)) = f(u1,f(u,X0)),
    inference(superposition,[status(thm)],[c_53,c_49]) ).

cnf(c_137,plain,
    f(u,f(n2,X0)) = f(u2,f(u,X0)),
    inference(superposition,[status(thm)],[c_54,c_49]) ).

cnf(c_138,plain,
    f(u,f(n3,X0)) = f(u3,f(u,X0)),
    inference(superposition,[status(thm)],[c_55,c_49]) ).

cnf(c_139,plain,
    f(u,f(u,X0)) = f(uu,f(u,X0)),
    inference(superposition,[status(thm)],[c_56,c_49]) ).

cnf(c_140,plain,
    f(f(n3,n2),f(u2,X0)) = f(a,f(f(n3,n2),X0)),
    inference(superposition,[status(thm)],[c_57,c_49]) ).

cnf(c_141,plain,
    f(u1,f(u3,X0)) = f(b,f(u1,X0)),
    inference(superposition,[status(thm)],[c_58,c_49]) ).

cnf(c_142,plain,
    f(uu,f(uu,X0)) = f(v,f(uu,X0)),
    inference(superposition,[status(thm)],[c_59,c_49]) ).

cnf(c_178,plain,
    f(n2,n2) = f(n1,n2),
    inference(superposition,[status(thm)],[c_50,c_133]) ).

cnf(c_183,plain,
    f(n1,n2) = u,
    inference(light_normalisation,[status(thm)],[c_178,c_52]) ).

cnf(c_189,plain,
    f(n2,u) = f(n1,u),
    inference(superposition,[status(thm)],[c_183,c_133]) ).

cnf(c_198,plain,
    f(n2,f(n1,n2)) = f(n3,u),
    inference(superposition,[status(thm)],[c_52,c_134]) ).

cnf(c_201,plain,
    f(n2,u) = f(n3,u),
    inference(light_normalisation,[status(thm)],[c_198,c_183]) ).

cnf(c_214,plain,
    f(n2,u) = f(u,u),
    inference(superposition,[status(thm)],[c_52,c_135]) ).

cnf(c_217,plain,
    f(n2,u) = uu,
    inference(light_normalisation,[status(thm)],[c_214,c_56]) ).

cnf(c_219,plain,
    f(n3,u) = uu,
    inference(demodulation,[status(thm)],[c_201,c_217]) ).

cnf(c_220,plain,
    f(n1,u) = uu,
    inference(demodulation,[status(thm)],[c_189,c_217]) ).

cnf(c_225,plain,
    f(n2,uu) = f(u,uu),
    inference(superposition,[status(thm)],[c_217,c_135]) ).

cnf(c_226,plain,
    f(n2,f(n1,u)) = f(n3,uu),
    inference(superposition,[status(thm)],[c_217,c_134]) ).

cnf(c_227,plain,
    f(n2,uu) = f(n3,uu),
    inference(light_normalisation,[status(thm)],[c_226,c_220]) ).

cnf(c_237,plain,
    f(f(n3,X0),uu) = f(n3,f(X0,u)),
    inference(superposition,[status(thm)],[c_219,c_49]) ).

cnf(c_243,plain,
    f(u,f(n1,u)) = f(u1,uu),
    inference(superposition,[status(thm)],[c_56,c_136]) ).

cnf(c_247,plain,
    f(n2,uu) = f(u1,uu),
    inference(light_normalisation,[status(thm)],[c_243,c_220,c_225]) ).

cnf(c_257,plain,
    f(n2,uu) = f(n1,uu),
    inference(superposition,[status(thm)],[c_220,c_133]) ).

cnf(c_283,plain,
    f(n2,f(n2,X0)) = f(u2,f(u,X0)),
    inference(light_normalisation,[status(thm)],[c_137,c_135]) ).

cnf(c_285,plain,
    f(n2,f(n2,n2)) = f(u2,u2),
    inference(superposition,[status(thm)],[c_54,c_283]) ).

cnf(c_295,plain,
    f(u2,u2) = uu,
    inference(light_normalisation,[status(thm)],[c_285,c_52,c_217]) ).

cnf(c_336,plain,
    f(u,f(n3,u)) = f(u3,uu),
    inference(superposition,[status(thm)],[c_56,c_138]) ).

cnf(c_343,plain,
    f(n2,uu) = f(u3,uu),
    inference(light_normalisation,[status(thm)],[c_336,c_219,c_225]) ).

cnf(c_396,plain,
    f(u,uu) = f(uu,uu),
    inference(superposition,[status(thm)],[c_56,c_139]) ).

cnf(c_406,plain,
    f(n2,uu) = v,
    inference(light_normalisation,[status(thm)],[c_396,c_59,c_225]) ).

cnf(c_409,plain,
    f(u3,uu) = v,
    inference(demodulation,[status(thm)],[c_343,c_406]) ).

cnf(c_411,plain,
    f(n1,uu) = v,
    inference(demodulation,[status(thm)],[c_257,c_406]) ).

cnf(c_412,plain,
    f(u1,uu) = v,
    inference(demodulation,[status(thm)],[c_247,c_406]) ).

cnf(c_413,plain,
    f(n3,uu) = v,
    inference(demodulation,[status(thm)],[c_227,c_406]) ).

cnf(c_414,plain,
    f(u,uu) = v,
    inference(demodulation,[status(thm)],[c_225,c_406]) ).

cnf(c_437,plain,
    f(uu,v) = f(v,v),
    inference(superposition,[status(thm)],[c_59,c_142]) ).

cnf(c_448,plain,
    f(n2,v) = f(u,v),
    inference(superposition,[status(thm)],[c_406,c_135]) ).

cnf(c_468,plain,
    f(u1,f(u3,uu)) = f(b,v),
    inference(superposition,[status(thm)],[c_412,c_141]) ).

cnf(c_469,plain,
    f(u1,v) = f(b,v),
    inference(light_normalisation,[status(thm)],[c_468,c_409]) ).

cnf(c_470,plain,
    f(u1,v) != f(a,v),
    inference(demodulation,[status(thm)],[c_60,c_469]) ).

cnf(c_526,plain,
    f(u,v) = f(uu,v),
    inference(superposition,[status(thm)],[c_414,c_139]) ).

cnf(c_529,plain,
    f(u,f(n1,uu)) = f(u1,v),
    inference(superposition,[status(thm)],[c_414,c_136]) ).

cnf(c_530,plain,
    f(n2,v) = f(uu,v),
    inference(light_normalisation,[status(thm)],[c_526,c_448]) ).

cnf(c_531,plain,
    f(n2,v) = f(u1,v),
    inference(light_normalisation,[status(thm)],[c_529,c_411,c_448]) ).

cnf(c_534,plain,
    f(n2,v) = f(v,v),
    inference(demodulation,[status(thm)],[c_437,c_530]) ).

cnf(c_547,plain,
    f(n2,v) != f(a,v),
    inference(light_normalisation,[status(thm)],[c_470,c_531]) ).

cnf(c_4887,plain,
    f(a,f(f(n3,n2),u2)) = f(f(n3,n2),uu),
    inference(superposition,[status(thm)],[c_295,c_140]) ).

cnf(c_4905,plain,
    f(f(n3,n2),uu) = f(a,a),
    inference(light_normalisation,[status(thm)],[c_4887,c_57]) ).

cnf(c_4991,plain,
    f(n3,f(n2,u)) = f(a,a),
    inference(superposition,[status(thm)],[c_4905,c_237]) ).

cnf(c_4992,plain,
    f(a,a) = v,
    inference(light_normalisation,[status(thm)],[c_4991,c_217,c_413]) ).

cnf(c_4998,plain,
    f(a,f(a,X0)) = f(v,f(a,X0)),
    inference(superposition,[status(thm)],[c_4992,c_49]) ).

cnf(c_5021,plain,
    f(a,v) = f(v,v),
    inference(superposition,[status(thm)],[c_4992,c_4998]) ).

cnf(c_5026,plain,
    f(n2,v) = f(a,v),
    inference(light_normalisation,[status(thm)],[c_5021,c_534]) ).

cnf(c_5027,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_5026,c_547]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : LDA002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n016.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 21:53:15 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.21/0.47  Running UEQ theorem proving
% 0.21/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.82/1.12  % SZS status Started for theBenchmark.p
% 3.82/1.12  % SZS status Unsatisfiable for theBenchmark.p
% 3.82/1.12  
% 3.82/1.12  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.82/1.12  
% 3.82/1.12  ------  iProver source info
% 3.82/1.12  
% 3.82/1.12  git: date: 2024-05-02 19:28:25 +0000
% 3.82/1.12  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.82/1.12  git: non_committed_changes: false
% 3.82/1.12  
% 3.82/1.12  ------ Parsing...successful
% 3.82/1.12  
% 3.82/1.12  
% 3.82/1.12  
% 3.82/1.12  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 3.82/1.12  
% 3.82/1.12  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.82/1.12  
% 3.82/1.12  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 3.82/1.12  ------ Proving...
% 3.82/1.12  ------ Problem Properties 
% 3.82/1.12  
% 3.82/1.12  
% 3.82/1.12  clauses                                 12
% 3.82/1.12  conjectures                             1
% 3.82/1.12  EPR                                     0
% 3.82/1.12  Horn                                    12
% 3.82/1.12  unary                                   12
% 3.82/1.12  binary                                  0
% 3.82/1.12  lits                                    12
% 3.82/1.12  lits eq                                 12
% 3.82/1.12  fd_pure                                 0
% 3.82/1.12  fd_pseudo                               0
% 3.82/1.12  fd_cond                                 0
% 3.82/1.12  fd_pseudo_cond                          0
% 3.82/1.12  AC symbols                              0
% 3.82/1.12  
% 3.82/1.12  ------ Input Options Time Limit: Unbounded
% 3.82/1.12  
% 3.82/1.12  
% 3.82/1.12  ------ 
% 3.82/1.12  Current options:
% 3.82/1.12  ------ 
% 3.82/1.12  
% 3.82/1.12  
% 3.82/1.12  
% 3.82/1.12  
% 3.82/1.12  ------ Proving...
% 3.82/1.12  
% 3.82/1.12  
% 3.82/1.12  % SZS status Unsatisfiable for theBenchmark.p
% 3.82/1.12  
% 3.82/1.12  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.82/1.13  
% 3.82/1.13  
%------------------------------------------------------------------------------