TSTP Solution File: ITP357_1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : ITP001_1 : TPTP v8.1.2. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n028.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:30:43 EDT 2024

% Result   : Theorem 209.07s 27.17s
% Output   : CNFRefutation 209.07s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f4778)

% Comments : 
%------------------------------------------------------------------------------
tff(f6,conjecture,
    'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$','phi$','append$'('w$','w$a'))),'true_ltln$'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture5) ).

tff(f7,negated_conjecture,
    ~ 'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$','phi$','append$'('w$','w$a'))),'true_ltln$'),
    inference(negated_conjecture,[],[f6]) ).

tff(f8,axiom,
    'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$','phi$','w$')),'true_ltln$'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',hypothesis6) ).

tff(f9,axiom,
    ! [X0: 'A_ltln$',X1: 'A_ltln$',X2: 'A_set_list$'] :
      ( 'fun_app$'('fun_app$d'('eq$',X0),X1)
     => 'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$',X0,X2)),'foldl$'('af_letter$',X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom7) ).

tff(f18,axiom,
    ! [X0: 'A_ltln_a_set_a_ltln_fun_fun$',X1: 'A_ltln$',X2: 'A_set_list$',X3: 'A_set_list$'] : ( 'foldl$'(X0,X1,'append$'(X2,X3)) = 'foldl$'(X0,'foldl$'(X0,X1,X2),X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom16) ).

tff(f486,axiom,
    'true_ltln$' = 'not_n$'('false_ltln$'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom484) ).

tff(f726,plain,
    ~ 'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$','phi$','append$'('w$','w$a'))),'true_ltln$'),
    inference(flattening,[],[f7]) ).

tff(f835,plain,
    ! [X0: 'A_ltln$',X1: 'A_ltln$',X2: 'A_set_list$'] :
      ( 'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$',X0,X2)),'foldl$'('af_letter$',X1,X2))
      | ~ 'fun_app$'('fun_app$d'('eq$',X0),X1) ),
    inference(ennf_transformation,[],[f9]) ).

tff(f2516,plain,
    ~ 'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$','phi$','append$'('w$','w$a'))),'true_ltln$'),
    inference(cnf_transformation,[],[f726]) ).

tff(f2517,plain,
    'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$','phi$','w$')),'true_ltln$'),
    inference(cnf_transformation,[],[f8]) ).

tff(f2518,plain,
    ! [X2: 'A_set_list$',X0: 'A_ltln$',X1: 'A_ltln$'] :
      ( 'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$',X0,X2)),'foldl$'('af_letter$',X1,X2))
      | ~ 'fun_app$'('fun_app$d'('eq$',X0),X1) ),
    inference(cnf_transformation,[],[f835]) ).

tff(f2527,plain,
    ! [X2: 'A_set_list$',X3: 'A_set_list$',X0: 'A_ltln_a_set_a_ltln_fun_fun$',X1: 'A_ltln$'] : ( 'foldl$'(X0,X1,'append$'(X2,X3)) = 'foldl$'(X0,'foldl$'(X0,X1,X2),X3) ),
    inference(cnf_transformation,[],[f18]) ).

tff(f3447,plain,
    'true_ltln$' = 'not_n$'('false_ltln$'),
    inference(cnf_transformation,[],[f486]) ).

cnf(c_72,negated_conjecture,
    ~ 'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$','phi$','append$'('w$','w$a'))),'true_ltln$'),
    inference(cnf_transformation,[],[f2516]) ).

cnf(c_73,negated_conjecture,
    'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$','phi$','w$')),'true_ltln$'),
    inference(cnf_transformation,[],[f2517]) ).

cnf(c_74,plain,
    ( ~ 'fun_app$'('fun_app$d'('eq$',X0_39),X1_39)
    | 'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$',X0_39,X0_37)),'foldl$'('af_letter$',X1_39,X0_37)) ),
    inference(cnf_transformation,[],[f2518]) ).

cnf(c_83,negated_conjecture,
    'foldl$'(X0_47,'foldl$'(X0_47,X0_39,X0_37),X1_37) = 'foldl$'(X0_47,X0_39,'append$'(X0_37,X1_37)),
    inference(cnf_transformation,[],[f2527]) ).

cnf(c_428,negated_conjecture,
    'foldl$'('af_letter$','true_ltln$',X0_37) = 'true_ltln$',
    inference(cnf_transformation,[],[f4776]) ).

cnf(c_429,negated_conjecture,
    ( 'foldl$'('af_letter$','true_ltln$',X0_37) = 'true_ltln$'
    | X0_29 = tltrue ),
    inference(cnf_transformation,[],[f4778]) ).

cnf(c_951,negated_conjecture,
    'not_n$'('false_ltln$') = 'true_ltln$',
    inference(cnf_transformation,[],[f3447]) ).

cnf(c_2527,negated_conjecture,
    'foldl$'('af_letter$','true_ltln$',X0_37) = 'true_ltln$',
    inference(global_subsumption_just,[status(thm)],[c_429,c_428]) ).

cnf(c_14814,plain,
    'foldl$'('af_letter$','not_n$'('false_ltln$'),X0_37) = 'not_n$'('false_ltln$'),
    inference(light_normalisation,[status(thm)],[c_2527,c_951]) ).

cnf(c_15017,plain,
    'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$','phi$','w$')),'not_n$'('false_ltln$')),
    inference(light_normalisation,[status(thm)],[c_73,c_951]) ).

cnf(c_15918,plain,
    ~ 'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$','phi$','append$'('w$','w$a'))),'not_n$'('false_ltln$')),
    inference(light_normalisation,[status(thm)],[c_72,c_951]) ).

cnf(c_17159,plain,
    ~ 'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$','foldl$'('af_letter$','phi$','w$'),'w$a')),'not_n$'('false_ltln$')),
    inference(demodulation,[status(thm)],[c_15918,c_83]) ).

cnf(c_322304,plain,
    ( ~ 'fun_app$'('fun_app$d'('eq$',X0_39),'not_n$'('false_ltln$'))
    | 'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$',X0_39,X0_37)),'not_n$'('false_ltln$')) ),
    inference(superposition,[status(thm)],[c_14814,c_74]) ).

cnf(c_414524,plain,
    ~ 'fun_app$'('fun_app$d'('eq$','foldl$'('af_letter$','phi$','w$')),'not_n$'('false_ltln$')),
    inference(superposition,[status(thm)],[c_322304,c_17159]) ).

cnf(c_417685,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_414524,c_15017]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : ITP001_1 : TPTP v8.1.2. Released v8.1.0.
% 0.10/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n028.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 22:15:18 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.20/0.47  Running TFA theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa --heuristic_context casc_unsat /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 209.07/27.17  % SZS status Started for theBenchmark.p
% 209.07/27.17  % SZS status Theorem for theBenchmark.p
% 209.07/27.17  
% 209.07/27.17  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 209.07/27.17  
% 209.07/27.17  ------  iProver source info
% 209.07/27.17  
% 209.07/27.17  git: date: 2024-05-02 19:28:25 +0000
% 209.07/27.17  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 209.07/27.17  git: non_committed_changes: false
% 209.07/27.17  
% 209.07/27.17  ------ Parsing...
% 209.07/27.17  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 209.07/27.17  
% 209.07/27.17  ------ Preprocessing... sup_sim: 144  sf_s  rm: 131 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e  sup_sim: 0  sf_s  rm: 34 0s  sf_e  pe_s  pe_e 
% 209.07/27.17  
% 209.07/27.17  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 209.07/27.17  
% 209.07/27.17  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 209.07/27.17  ------ Proving...
% 209.07/27.17  ------ Problem Properties 
% 209.07/27.17  
% 209.07/27.17  
% 209.07/27.17  clauses                                 1182
% 209.07/27.17  conjectures                             101
% 209.07/27.17  EPR                                     58
% 209.07/27.17  Horn                                    998
% 209.07/27.17  unary                                   254
% 209.07/27.17  binary                                  631
% 209.07/27.17  lits                                    3222
% 209.07/27.17  lits eq                                 686
% 209.07/27.17  fd_pure                                 1
% 209.07/27.17  fd_pseudo                               0
% 209.07/27.17  fd_cond                                 65
% 209.07/27.17  fd_pseudo_cond                          36
% 209.07/27.17  AC symbols                              1
% 209.07/27.17  
% 209.07/27.17  ------ Input Options Time Limit: Unbounded
% 209.07/27.17  
% 209.07/27.17  
% 209.07/27.17  ------ 
% 209.07/27.17  Current options:
% 209.07/27.17  ------ 
% 209.07/27.17  
% 209.07/27.17  
% 209.07/27.17  
% 209.07/27.17  
% 209.07/27.17  ------ Proving...
% 209.07/27.17  
% 209.07/27.17  
% 209.07/27.17  % SZS status Theorem for theBenchmark.p
% 209.07/27.17  
% 209.07/27.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 209.07/27.17  
% 209.07/27.17  
%------------------------------------------------------------------------------