TSTP Solution File: NUM482+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM482+1 : TPTP v8.1.2. Released v4.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 11:30:49 EDT 2023
% Result : Theorem 3.44s 1.22s
% Output : CNFRefutation 3.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 10 unt; 0 def)
% Number of atoms : 122 ( 21 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 143 ( 60 ~; 53 |; 21 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn; 35 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
( sz00 != sz10
& aNaturalNumber0(sz10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC_01) ).
fof(f5,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> aNaturalNumber0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
fof(f11,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sdtasdt0(sz10,X0) = X0
& sdtasdt0(X0,sz10) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_MulUnit) ).
fof(f30,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( doDivides0(X0,X1)
<=> ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiv) ).
fof(f38,axiom,
aNaturalNumber0(xk),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1716) ).
fof(f41,conjecture,
( isPrime0(xk)
=> ? [X0] :
( isPrime0(X0)
& doDivides0(X0,xk)
& aNaturalNumber0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f42,negated_conjecture,
~ ( isPrime0(xk)
=> ? [X0] :
( isPrime0(X0)
& doDivides0(X0,xk)
& aNaturalNumber0(X0) ) ),
inference(negated_conjecture,[],[f41]) ).
fof(f47,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f48,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f47]) ).
fof(f58,plain,
! [X0] :
( ( sdtasdt0(sz10,X0) = X0
& sdtasdt0(X0,sz10) = X0 )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f91,plain,
! [X0,X1] :
( ( doDivides0(X0,X1)
<=> ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f92,plain,
! [X0,X1] :
( ( doDivides0(X0,X1)
<=> ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f91]) ).
fof(f109,plain,
( ! [X0] :
( ~ isPrime0(X0)
| ~ doDivides0(X0,xk)
| ~ aNaturalNumber0(X0) )
& isPrime0(xk) ),
inference(ennf_transformation,[],[f42]) ).
fof(f116,plain,
! [X0,X1] :
( ( ( doDivides0(X0,X1)
| ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) ) )
& ( ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) )
| ~ doDivides0(X0,X1) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(nnf_transformation,[],[f92]) ).
fof(f117,plain,
! [X0,X1] :
( ( ( doDivides0(X0,X1)
| ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) ) )
& ( ? [X3] :
( sdtasdt0(X0,X3) = X1
& aNaturalNumber0(X3) )
| ~ doDivides0(X0,X1) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(rectify,[],[f116]) ).
fof(f118,plain,
! [X0,X1] :
( ? [X3] :
( sdtasdt0(X0,X3) = X1
& aNaturalNumber0(X3) )
=> ( sdtasdt0(X0,sK1(X0,X1)) = X1
& aNaturalNumber0(sK1(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f119,plain,
! [X0,X1] :
( ( ( doDivides0(X0,X1)
| ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) ) )
& ( ( sdtasdt0(X0,sK1(X0,X1)) = X1
& aNaturalNumber0(sK1(X0,X1)) )
| ~ doDivides0(X0,X1) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f117,f118]) ).
fof(f130,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[],[f3]) ).
fof(f133,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f140,plain,
! [X0] :
( sdtasdt0(X0,sz10) = X0
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f178,plain,
! [X2,X0,X1] :
( doDivides0(X0,X1)
| sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f194,plain,
aNaturalNumber0(xk),
inference(cnf_transformation,[],[f38]) ).
fof(f200,plain,
isPrime0(xk),
inference(cnf_transformation,[],[f109]) ).
fof(f201,plain,
! [X0] :
( ~ isPrime0(X0)
| ~ doDivides0(X0,xk)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f208,plain,
! [X2,X0] :
( doDivides0(X0,sdtasdt0(X0,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(sdtasdt0(X0,X2))
| ~ aNaturalNumber0(X0) ),
inference(equality_resolution,[],[f178]) ).
cnf(c_51,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[],[f130]) ).
cnf(c_53,plain,
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f133]) ).
cnf(c_61,plain,
( ~ aNaturalNumber0(X0)
| sdtasdt0(X0,sz10) = X0 ),
inference(cnf_transformation,[],[f140]) ).
cnf(c_95,plain,
( ~ aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| doDivides0(X0,sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f208]) ).
cnf(c_113,plain,
aNaturalNumber0(xk),
inference(cnf_transformation,[],[f194]) ).
cnf(c_119,negated_conjecture,
( ~ doDivides0(X0,xk)
| ~ aNaturalNumber0(X0)
| ~ isPrime0(X0) ),
inference(cnf_transformation,[],[f201]) ).
cnf(c_120,negated_conjecture,
isPrime0(xk),
inference(cnf_transformation,[],[f200]) ).
cnf(c_168,plain,
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| doDivides0(X0,sdtasdt0(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_95,c_53,c_95]) ).
cnf(c_1530,plain,
( X0 != xk
| ~ doDivides0(X0,xk)
| ~ aNaturalNumber0(X0) ),
inference(resolution_lifted,[status(thm)],[c_119,c_120]) ).
cnf(c_1531,plain,
( ~ doDivides0(xk,xk)
| ~ aNaturalNumber0(xk) ),
inference(unflattening,[status(thm)],[c_1530]) ).
cnf(c_4336,plain,
sdtasdt0(xk,sz10) = xk,
inference(superposition,[status(thm)],[c_113,c_61]) ).
cnf(c_4394,plain,
( ~ aNaturalNumber0(sz10)
| ~ aNaturalNumber0(xk)
| doDivides0(xk,xk) ),
inference(superposition,[status(thm)],[c_4336,c_168]) ).
cnf(c_4395,plain,
doDivides0(xk,xk),
inference(forward_subsumption_resolution,[status(thm)],[c_4394,c_113,c_51]) ).
cnf(c_4396,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4395,c_1531,c_113]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.17 % Problem : NUM482+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.17 % Command : run_iprover %s %d THM
% 0.17/0.39 % Computer : n008.cluster.edu
% 0.17/0.39 % Model : x86_64 x86_64
% 0.17/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.39 % Memory : 8042.1875MB
% 0.17/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.39 % CPULimit : 300
% 0.17/0.39 % WCLimit : 300
% 0.17/0.39 % DateTime : Fri Aug 25 15:05:18 EDT 2023
% 0.17/0.39 % CPUTime :
% 0.24/0.51 Running first-order theorem proving
% 0.24/0.51 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.44/1.22 % SZS status Started for theBenchmark.p
% 3.44/1.22 % SZS status Theorem for theBenchmark.p
% 3.44/1.22
% 3.44/1.22 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.44/1.22
% 3.44/1.22 ------ iProver source info
% 3.44/1.22
% 3.44/1.22 git: date: 2023-05-31 18:12:56 +0000
% 3.44/1.22 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.44/1.22 git: non_committed_changes: false
% 3.44/1.22 git: last_make_outside_of_git: false
% 3.44/1.22
% 3.44/1.22 ------ Parsing...
% 3.44/1.22 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.44/1.22
% 3.44/1.22 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 3.44/1.22
% 3.44/1.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.44/1.22
% 3.44/1.22 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.44/1.22 ------ Proving...
% 3.44/1.22 ------ Problem Properties
% 3.44/1.22
% 3.44/1.22
% 3.44/1.22 clauses 66
% 3.44/1.22 conjectures 2
% 3.44/1.22 EPR 18
% 3.44/1.22 Horn 43
% 3.44/1.22 unary 9
% 3.44/1.22 binary 7
% 3.44/1.22 lits 258
% 3.44/1.22 lits eq 75
% 3.44/1.22 fd_pure 0
% 3.44/1.22 fd_pseudo 0
% 3.44/1.22 fd_cond 15
% 3.44/1.22 fd_pseudo_cond 10
% 3.44/1.22 AC symbols 0
% 3.44/1.22
% 3.44/1.22 ------ Schedule dynamic 5 is on
% 3.44/1.22
% 3.44/1.22 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.44/1.22
% 3.44/1.22
% 3.44/1.22 ------
% 3.44/1.22 Current options:
% 3.44/1.22 ------
% 3.44/1.22
% 3.44/1.22
% 3.44/1.22
% 3.44/1.22
% 3.44/1.22 ------ Proving...
% 3.44/1.22
% 3.44/1.22
% 3.44/1.22 % SZS status Theorem for theBenchmark.p
% 3.44/1.22
% 3.44/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.44/1.22
% 3.44/1.22
%------------------------------------------------------------------------------