TSTP Solution File: PUZ034-1.004 by iProver---3.8

View Problem - Process Solution

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

% Computer : n009.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 13:19:38 EDT 2023

% Result   : Timeout 299.97s 40.38s
% Output   : None 
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    ( ~ sum(X0,s(n0),X1)
    | ~ range(X1,X2,X3)
    | ~ less(X0,X2)
    | range(X0,X2,cons(X0,X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',make_list_of_numbers1) ).

cnf(c_50,plain,
    range(X0,X0,cons(X0,empty_list)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',make_list_of_numbers2) ).

cnf(c_51,plain,
    less(n0,s(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less1) ).

cnf(c_52,plain,
    ( ~ less(X0,X1)
    | less(s(X0),s(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less2) ).

cnf(c_53,plain,
    sum(X0,n0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_0) ).

cnf(c_54,plain,
    ( ~ sum(X0,X1,X2)
    | sum(X0,s(X1),s(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add) ).

cnf(c_55,plain,
    select(X0,cons(X0,X1),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',select1) ).

cnf(c_56,plain,
    ( ~ select(X0,X1,X2)
    | select(X0,cons(X3,X1),cons(X3,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',select2) ).

cnf(c_57,plain,
    ~ same(s(X0),n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',same_definition1) ).

cnf(c_58,plain,
    ~ same(n0,s(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',same_definition2) ).

cnf(c_59,plain,
    ( ~ same(s(X0),s(X1))
    | same(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',same_definition3) ).

cnf(c_60,plain,
    ( ~ attack(X0,X1)
    | diagonal_attack(X0,s(n0),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',attack) ).

cnf(c_61,plain,
    ( ~ diagonal_attack(X0,X1,cons(X2,X3))
    | ~ sum(X1,s(n0),X4)
    | ~ sum(X2,X1,X5)
    | ~ sum(X6,X1,X2)
    | diagonal_attack(X0,X4,X3)
    | same(X5,X0)
    | same(X6,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',check_diagonals1) ).

cnf(c_62,plain,
    ~ diagonal_attack(X0,X1,empty_list),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',check_diagonals2) ).

cnf(c_63,plain,
    ( ~ do_queens(X0,cons(X1,X2),X3)
    | ~ select(X1,X4,X0)
    | do_queens(X4,X2,X3)
    | attack(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',place_a_queen1) ).

cnf(c_64,plain,
    do_queens(empty_list,X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',place_a_queen2) ).

cnf(c_65,plain,
    ( ~ sum(X0,s(n0),X1)
    | ~ range(X1,X2,X3)
    | ~ sum(X0,X0,X2)
    | ~ do_queens(X3,empty_list,X4)
    | queens(X0,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_up_queens) ).

cnf(c_66,negated_conjecture,
    ~ queens(s(s(s(s(n0)))),X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',place_queens) ).

cnf(c_163,plain,
    ( ~ do_queens(X0,cons(X1,X2),X3)
    | ~ select(X1,X4,X0)
    | diagonal_attack(X1,s(n0),X2)
    | do_queens(X4,X2,X3) ),
    inference(resolution,[status(thm)],[c_60,c_63]) ).

cnf(c_181,plain,
    ( ~ sum(s(s(s(s(n0)))),s(s(s(s(n0)))),X0)
    | ~ sum(s(s(s(s(n0)))),s(n0),X1)
    | ~ range(X1,X0,X2)
    | ~ do_queens(X2,empty_list,X3) ),
    inference(resolution,[status(thm)],[c_65,c_66]) ).

cnf(c_269,plain,
    ( ~ sum(s(s(s(s(n0)))),s(s(s(s(n0)))),X0_13)
    | ~ sum(s(s(s(s(n0)))),s(n0),X1_13)
    | ~ range(X1_13,X0_13,X0_14)
    | ~ do_queens(X0_14,empty_list,X1_14) ),
    inference(subtyping,[status(esa)],[c_181]) ).

cnf(c_270,plain,
    ( ~ do_queens(X0_14,cons(X0_13,X1_14),X2_14)
    | ~ select(X0_13,X3_14,X0_14)
    | diagonal_attack(X0_13,s(n0),X1_14)
    | do_queens(X3_14,X1_14,X2_14) ),
    inference(subtyping,[status(esa)],[c_163]) ).

cnf(c_271,plain,
    do_queens(empty_list,X0_14,X0_14),
    inference(subtyping,[status(esa)],[c_64]) ).

cnf(c_272,plain,
    ~ diagonal_attack(X0_13,X1_13,empty_list),
    inference(subtyping,[status(esa)],[c_62]) ).

cnf(c_273,plain,
    ( ~ diagonal_attack(X0_13,X1_13,cons(X2_13,X0_14))
    | ~ sum(X1_13,s(n0),X3_13)
    | ~ sum(X2_13,X1_13,X4_13)
    | ~ sum(X5_13,X1_13,X2_13)
    | diagonal_attack(X0_13,X3_13,X0_14)
    | same(X4_13,X0_13)
    | same(X5_13,X0_13) ),
    inference(subtyping,[status(esa)],[c_61]) ).

cnf(c_274,plain,
    ( ~ same(s(X0_13),s(X1_13))
    | same(X0_13,X1_13) ),
    inference(subtyping,[status(esa)],[c_59]) ).

cnf(c_275,plain,
    ~ same(n0,s(X0_13)),
    inference(subtyping,[status(esa)],[c_58]) ).

cnf(c_276,plain,
    ~ same(s(X0_13),n0),
    inference(subtyping,[status(esa)],[c_57]) ).

cnf(c_277,plain,
    ( ~ select(X0_13,X0_14,X1_14)
    | select(X0_13,cons(X1_13,X0_14),cons(X1_13,X1_14)) ),
    inference(subtyping,[status(esa)],[c_56]) ).

cnf(c_278,plain,
    select(X0_13,cons(X0_13,X0_14),X0_14),
    inference(subtyping,[status(esa)],[c_55]) ).

cnf(c_279,plain,
    ( ~ sum(X0_13,X1_13,X2_13)
    | sum(X0_13,s(X1_13),s(X2_13)) ),
    inference(subtyping,[status(esa)],[c_54]) ).

cnf(c_280,plain,
    sum(X0_13,n0,X0_13),
    inference(subtyping,[status(esa)],[c_53]) ).

cnf(c_281,plain,
    ( ~ less(X0_13,X1_13)
    | less(s(X0_13),s(X1_13)) ),
    inference(subtyping,[status(esa)],[c_52]) ).

cnf(c_282,plain,
    less(n0,s(X0_13)),
    inference(subtyping,[status(esa)],[c_51]) ).

cnf(c_283,plain,
    range(X0_13,X0_13,cons(X0_13,empty_list)),
    inference(subtyping,[status(esa)],[c_50]) ).

cnf(c_284,plain,
    ( ~ sum(X0_13,s(n0),X1_13)
    | ~ range(X1_13,X2_13,X0_14)
    | ~ less(X0_13,X2_13)
    | range(X0_13,X2_13,cons(X0_13,X0_14)) ),
    inference(subtyping,[status(esa)],[c_49]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : PUZ034-1.004 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.12  % Command  : run_iprover %s %d THM
% 0.11/0.33  % Computer : n009.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 300
% 0.11/0.33  % DateTime : Sat Aug 26 22:13:50 EDT 2023
% 0.11/0.33  % CPUTime  : 
% 0.18/0.45  Running first-order theorem proving
% 0.18/0.45  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 299.97/40.38  % SZS status Started for theBenchmark.p
% 299.97/40.38  % SZS status Satisfiable for theBenchmark.p
% 299.97/40.38  
% 299.97/40.38  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 299.97/40.38  
% 299.97/40.38  ------  iProver source info
% 299.97/40.38  
% 299.97/40.38  git: date: 2023-05-31 18:12:56 +0000
% 299.97/40.38  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 299.97/40.38  git: non_committed_changes: false
% 299.97/40.38  git: last_make_outside_of_git: false
% 299.97/40.38  
% 299.97/40.38  ------ Parsing...successful
% 299.97/40.38  
% 299.97/40.38  
% 299.97/40.38  
% 299.97/40.38  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 299.97/40.38  
% 299.97/40.38  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 299.97/40.38  ------ Proving...
% 299.97/40.38  ------ Problem Properties 
% 299.97/40.38  
% 299.97/40.38  
% 299.97/40.38  clauses                                 16
% 299.97/40.38  conjectures                             0
% 299.97/40.38  EPR                                     3
% 299.97/40.38  Horn                                    14
% 299.97/40.38  unary                                   8
% 299.97/40.38  binary                                  4
% 299.97/40.38  lits                                    35
% 299.97/40.38  lits eq                                 0
% 299.97/40.38  fd_pure                                 0
% 299.97/40.38  fd_pseudo                               0
% 299.97/40.38  fd_cond                                 0
% 299.97/40.38  fd_pseudo_cond                          0
% 299.97/40.38  AC symbols                              0
% 299.97/40.38  
% 299.97/40.38  ------ Input Options Time Limit: Unbounded
% 299.97/40.38  
% 299.97/40.38  
% 299.97/40.38  ------ 
% 299.97/40.38  Current options:
% 299.97/40.38  ------ 
% 299.97/40.38  
% 299.97/40.38  
% 299.97/40.38  
% 299.97/40.38  
% 299.97/40.38  ------ Proving...
% 299.97/40.38  
% 299.97/40.38  
% 299.97/40.38  % SZS status Satisfiable for theBenchmark.p
% 299.97/40.38  
% 299.97/40.38  % SZS output start Saturation for theBenchmark.p
% See solution above
% 299.97/40.38  
% 299.97/40.38  
%------------------------------------------------------------------------------