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

View Problem - Process Solution

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

% Computer : n025.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:48:06 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    ~ less(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',nothing_is_less_than_itself) ).

cnf(c_50,plain,
    ( ~ less(X0,X1)
    | ~ less(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',numbers_are_different) ).

cnf(c_54,plain,
    less(X0,factorial_plus_one(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_prime_is_less_than_the_next_one) ).

cnf(c_55,plain,
    ( ~ divides(X0,factorial_plus_one(X1))
    | less(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor_is_smaller) ).

cnf(c_56,plain,
    ( divides(prime_divisor(X0),X0)
    | prime(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',division_by_prime_divisor) ).

cnf(c_57,plain,
    ( prime(prime_divisor(X0))
    | prime(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prime_divsiors) ).

cnf(c_58,plain,
    ( less(prime_divisor(X0),X0)
    | prime(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',smaller_prime_divisors) ).

cnf(c_60,negated_conjecture,
    ( ~ less(a,X0)
    | ~ prime(X0)
    | less(factorial_plus_one(a),X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_another_prime) ).

cnf(c_109,plain,
    factorial_plus_one(a) = sP0_iProver_def,
    definition ).

cnf(c_110,negated_conjecture,
    ( ~ less(a,X0)
    | ~ prime(X0)
    | less(sP0_iProver_def,X0) ),
    inference(demodulation,[status(thm)],[c_60,c_109]) ).

cnf(c_286,plain,
    ( ~ prime(factorial_plus_one(a))
    | less(sP0_iProver_def,factorial_plus_one(a)) ),
    inference(superposition,[status(thm)],[c_54,c_110]) ).

cnf(c_287,plain,
    ( ~ prime(sP0_iProver_def)
    | less(sP0_iProver_def,sP0_iProver_def) ),
    inference(light_normalisation,[status(thm)],[c_286,c_109]) ).

cnf(c_288,plain,
    ~ prime(sP0_iProver_def),
    inference(forward_subsumption_resolution,[status(thm)],[c_287,c_49]) ).

cnf(c_308,plain,
    ( ~ less(X0,prime_divisor(X0))
    | prime(X0) ),
    inference(superposition,[status(thm)],[c_58,c_50]) ).

cnf(c_339,plain,
    ( ~ divides(X0,sP0_iProver_def)
    | less(a,X0) ),
    inference(superposition,[status(thm)],[c_109,c_55]) ).

cnf(c_351,plain,
    ( less(a,prime_divisor(sP0_iProver_def))
    | prime(sP0_iProver_def) ),
    inference(superposition,[status(thm)],[c_56,c_339]) ).

cnf(c_352,plain,
    less(a,prime_divisor(sP0_iProver_def)),
    inference(forward_subsumption_resolution,[status(thm)],[c_351,c_288]) ).

cnf(c_355,plain,
    ( ~ prime(prime_divisor(sP0_iProver_def))
    | less(sP0_iProver_def,prime_divisor(sP0_iProver_def)) ),
    inference(superposition,[status(thm)],[c_352,c_110]) ).

cnf(c_364,plain,
    ( ~ prime(prime_divisor(sP0_iProver_def))
    | prime(sP0_iProver_def) ),
    inference(superposition,[status(thm)],[c_355,c_308]) ).

cnf(c_365,plain,
    ~ prime(prime_divisor(sP0_iProver_def)),
    inference(forward_subsumption_resolution,[status(thm)],[c_364,c_288]) ).

cnf(c_366,plain,
    prime(sP0_iProver_def),
    inference(superposition,[status(thm)],[c_57,c_365]) ).

cnf(c_367,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_366,c_288]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : NUM016-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n025.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu May  2 19:42:43 EDT 2024
% 0.21/0.35  % CPUTime  : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  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
% 2.03/1.22  % SZS status Started for theBenchmark.p
% 2.03/1.22  % SZS status Unsatisfiable for theBenchmark.p
% 2.03/1.22  
% 2.03/1.22  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.03/1.22  
% 2.03/1.22  ------  iProver source info
% 2.03/1.22  
% 2.03/1.22  git: date: 2024-05-02 19:28:25 +0000
% 2.03/1.22  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.03/1.22  git: non_committed_changes: false
% 2.03/1.22  
% 2.03/1.22  ------ Parsing...successful
% 2.03/1.22  
% 2.03/1.22  
% 2.03/1.22  
% 2.03/1.22  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 2.03/1.22  
% 2.03/1.22  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.03/1.22  
% 2.03/1.22  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.03/1.22  ------ Proving...
% 2.03/1.22  ------ Problem Properties 
% 2.03/1.22  
% 2.03/1.22  
% 2.03/1.22  clauses                                 13
% 2.03/1.22  conjectures                             1
% 2.03/1.22  EPR                                     7
% 2.03/1.22  Horn                                    10
% 2.03/1.22  unary                                   5
% 2.03/1.22  binary                                  6
% 2.03/1.22  lits                                    23
% 2.03/1.22  lits eq                                 1
% 2.03/1.22  fd_pure                                 0
% 2.03/1.22  fd_pseudo                               0
% 2.03/1.22  fd_cond                                 0
% 2.03/1.22  fd_pseudo_cond                          0
% 2.03/1.22  AC symbols                              0
% 2.03/1.22  
% 2.03/1.22  ------ Schedule dynamic 5 is on 
% 2.03/1.22  
% 2.03/1.22  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.03/1.22  
% 2.03/1.22  
% 2.03/1.22  ------ 
% 2.03/1.22  Current options:
% 2.03/1.22  ------ 
% 2.03/1.22  
% 2.03/1.22  
% 2.03/1.22  
% 2.03/1.22  
% 2.03/1.22  ------ Proving...
% 2.03/1.22  
% 2.03/1.22  
% 2.03/1.22  % SZS status Unsatisfiable for theBenchmark.p
% 2.03/1.22  
% 2.03/1.22  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.03/1.22  
% 2.03/1.22  
%------------------------------------------------------------------------------