TSTP Solution File: NUM430+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM430+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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:49:15 EDT 2024
% Result : Theorem 7.60s 1.64s
% Output : CNFRefutation 7.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 70 ( 15 unt; 0 def)
% Number of atoms : 239 ( 75 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 290 ( 121 ~; 117 |; 39 &)
% ( 5 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 93 ( 0 sgn 61 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntZero) ).
fof(f4,axiom,
! [X0] :
( aInteger0(X0)
=> aInteger0(smndt0(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntNeg) ).
fof(f5,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> aInteger0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntPlus) ).
fof(f15,axiom,
! [X0] :
( aInteger0(X0)
=> ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulZero) ).
fof(f17,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> ( sz00 = sdtasdt0(X0,X1)
=> ( sz00 = X1
| sz00 = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroDiv) ).
fof(f18,axiom,
! [X0] :
( aInteger0(X0)
=> ! [X1] :
( aDivisorOf0(X1,X0)
<=> ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& sz00 != X1
& aInteger0(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDivisor) ).
fof(f19,axiom,
! [X0,X1,X2] :
( ( sz00 != X2
& aInteger0(X2)
& aInteger0(X1)
& aInteger0(X0) )
=> ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEquMod) ).
fof(f22,axiom,
( aInteger0(xc)
& sz00 != xq
& aInteger0(xq)
& aInteger0(xb)
& aInteger0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__818) ).
fof(f23,axiom,
( sdteqdtlpzmzozddtrp0(xb,xc,xq)
& sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__853) ).
fof(f25,conjecture,
? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
& aInteger0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f26,negated_conjecture,
~ ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
& aInteger0(X0) ),
inference(negated_conjecture,[],[f25]) ).
fof(f28,plain,
! [X0] :
( aInteger0(smndt0(X0))
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f29,plain,
! [X0,X1] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f30,plain,
! [X0,X1] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f29]) ).
fof(f46,plain,
! [X0] :
( ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) )
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f48,plain,
! [X0,X1] :
( sz00 = X1
| sz00 = X0
| sz00 != sdtasdt0(X0,X1)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f17]) ).
fof(f49,plain,
! [X0,X1] :
( sz00 = X1
| sz00 = X0
| sz00 != sdtasdt0(X0,X1)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f48]) ).
fof(f50,plain,
! [X0] :
( ! [X1] :
( aDivisorOf0(X1,X0)
<=> ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& sz00 != X1
& aInteger0(X1) ) )
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
| sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
| sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f51]) ).
fof(f57,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xc))
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f58,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ! [X2] :
( sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2) )
| sz00 = X1
| ~ aInteger0(X1) )
& ( ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& sz00 != X1
& aInteger0(X1) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(nnf_transformation,[],[f50]) ).
fof(f59,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ! [X2] :
( sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2) )
| sz00 = X1
| ~ aInteger0(X1) )
& ( ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& sz00 != X1
& aInteger0(X1) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(flattening,[],[f58]) ).
fof(f60,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ! [X2] :
( sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2) )
| sz00 = X1
| ~ aInteger0(X1) )
& ( ( ? [X3] :
( sdtasdt0(X1,X3) = X0
& aInteger0(X3) )
& sz00 != X1
& aInteger0(X1) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(rectify,[],[f59]) ).
fof(f61,plain,
! [X0,X1] :
( ? [X3] :
( sdtasdt0(X1,X3) = X0
& aInteger0(X3) )
=> ( sdtasdt0(X1,sK0(X0,X1)) = X0
& aInteger0(sK0(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f62,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ! [X2] :
( sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2) )
| sz00 = X1
| ~ aInteger0(X1) )
& ( ( sdtasdt0(X1,sK0(X0,X1)) = X0
& aInteger0(sK0(X0,X1))
& sz00 != X1
& aInteger0(X1) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f60,f61]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
| ~ aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
& ( aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| ~ sdteqdtlpzmzozddtrp0(X0,X1,X2) ) )
| sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(nnf_transformation,[],[f52]) ).
fof(f64,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f66,plain,
! [X0] :
( aInteger0(smndt0(X0))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f67,plain,
! [X0,X1] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f81,plain,
! [X0] :
( sz00 = sdtasdt0(X0,sz00)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f85,plain,
! [X0,X1] :
( sz00 = X1
| sz00 = X0
| sz00 != sdtasdt0(X0,X1)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f49]) ).
fof(f88,plain,
! [X0,X1] :
( aInteger0(sK0(X0,X1))
| ~ aDivisorOf0(X1,X0)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f89,plain,
! [X0,X1] :
( sdtasdt0(X1,sK0(X0,X1)) = X0
| ~ aDivisorOf0(X1,X0)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f91,plain,
! [X2,X0,X1] :
( aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| ~ sdteqdtlpzmzozddtrp0(X0,X1,X2)
| sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f96,plain,
aInteger0(xb),
inference(cnf_transformation,[],[f22]) ).
fof(f97,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f22]) ).
fof(f98,plain,
sz00 != xq,
inference(cnf_transformation,[],[f22]) ).
fof(f99,plain,
aInteger0(xc),
inference(cnf_transformation,[],[f22]) ).
fof(f101,plain,
sdteqdtlpzmzozddtrp0(xb,xc,xq),
inference(cnf_transformation,[],[f23]) ).
fof(f104,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xc))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_49,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f64]) ).
cnf(c_51,plain,
( ~ aInteger0(X0)
| aInteger0(smndt0(X0)) ),
inference(cnf_transformation,[],[f66]) ).
cnf(c_52,plain,
( ~ aInteger0(X0)
| ~ aInteger0(X1)
| aInteger0(sdtpldt0(X0,X1)) ),
inference(cnf_transformation,[],[f67]) ).
cnf(c_67,plain,
( ~ aInteger0(X0)
| sdtasdt0(X0,sz00) = sz00 ),
inference(cnf_transformation,[],[f81]) ).
cnf(c_70,plain,
( sdtasdt0(X0,X1) != sz00
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| X0 = sz00
| X1 = sz00 ),
inference(cnf_transformation,[],[f85]) ).
cnf(c_72,plain,
( ~ aDivisorOf0(X0,X1)
| ~ aInteger0(X1)
| sdtasdt0(X0,sK0(X1,X0)) = X1 ),
inference(cnf_transformation,[],[f89]) ).
cnf(c_73,plain,
( ~ aDivisorOf0(X0,X1)
| ~ aInteger0(X1)
| aInteger0(sK0(X1,X0)) ),
inference(cnf_transformation,[],[f88]) ).
cnf(c_77,plain,
( ~ sdteqdtlpzmzozddtrp0(X0,X1,X2)
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| X2 = sz00
| aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) ),
inference(cnf_transformation,[],[f91]) ).
cnf(c_80,plain,
aInteger0(xc),
inference(cnf_transformation,[],[f99]) ).
cnf(c_81,plain,
sz00 != xq,
inference(cnf_transformation,[],[f98]) ).
cnf(c_82,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f97]) ).
cnf(c_83,plain,
aInteger0(xb),
inference(cnf_transformation,[],[f96]) ).
cnf(c_85,plain,
sdteqdtlpzmzozddtrp0(xb,xc,xq),
inference(cnf_transformation,[],[f101]) ).
cnf(c_89,negated_conjecture,
( sdtpldt0(xb,smndt0(xc)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f104]) ).
cnf(c_92,plain,
( ~ aInteger0(sz00)
| sdtasdt0(sz00,sz00) = sz00 ),
inference(instantiation,[status(thm)],[c_67]) ).
cnf(c_107,plain,
( sdtasdt0(sz00,sz00) != sz00
| ~ aInteger0(sz00)
| sz00 = sz00 ),
inference(instantiation,[status(thm)],[c_70]) ).
cnf(c_517,plain,
X0 = X0,
theory(equality) ).
cnf(c_519,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_1120,plain,
( sz00 != X0
| xq != X0 ),
inference(resolution,[status(thm)],[c_519,c_81]) ).
cnf(c_1121,plain,
( sz00 != sz00
| xq != sz00 ),
inference(instantiation,[status(thm)],[c_1120]) ).
cnf(c_1122,plain,
( sdtpldt0(xb,smndt0(xc)) != X0
| sdtasdt0(xq,X1) != X0
| ~ aInteger0(X1) ),
inference(resolution,[status(thm)],[c_519,c_89]) ).
cnf(c_1160,plain,
( sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xc))
| ~ aInteger0(X0) ),
inference(resolution,[status(thm)],[c_1122,c_517]) ).
cnf(c_1179,plain,
( ~ aInteger0(sK0(sdtpldt0(xb,smndt0(xc)),xq))
| ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
| ~ aInteger0(sdtpldt0(xb,smndt0(xc))) ),
inference(resolution,[status(thm)],[c_1160,c_72]) ).
cnf(c_1493,plain,
( ~ sdteqdtlpzmzozddtrp0(X0,X1,xq)
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(xq)
| xq = sz00
| aDivisorOf0(xq,sdtpldt0(X0,smndt0(X1))) ),
inference(instantiation,[status(thm)],[c_77]) ).
cnf(c_1542,plain,
( ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
| ~ aInteger0(sdtpldt0(xb,smndt0(xc))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1179,c_73]) ).
cnf(c_1712,plain,
( ~ aInteger0(xc)
| aInteger0(smndt0(xc)) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_1932,plain,
( ~ aInteger0(smndt0(xc))
| ~ aInteger0(xb)
| aInteger0(sdtpldt0(xb,smndt0(xc))) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_9413,plain,
( ~ sdteqdtlpzmzozddtrp0(xb,xc,xq)
| ~ aInteger0(xc)
| ~ aInteger0(xq)
| ~ aInteger0(xb)
| xq = sz00
| aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc))) ),
inference(instantiation,[status(thm)],[c_1493]) ).
cnf(c_9414,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_9413,c_1932,c_1712,c_1542,c_1121,c_107,c_92,c_85,c_49,c_80,c_82,c_83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM430+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n017.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 : Thu May 2 19:17:06 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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
% 7.60/1.64 % SZS status Started for theBenchmark.p
% 7.60/1.64 % SZS status Theorem for theBenchmark.p
% 7.60/1.64
% 7.60/1.64 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.60/1.64
% 7.60/1.64 ------ iProver source info
% 7.60/1.64
% 7.60/1.64 git: date: 2024-05-02 19:28:25 +0000
% 7.60/1.64 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.60/1.64 git: non_committed_changes: false
% 7.60/1.64
% 7.60/1.64 ------ Parsing...
% 7.60/1.64 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.60/1.64
% 7.60/1.64 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 7.60/1.64
% 7.60/1.64 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.60/1.64
% 7.60/1.64 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.60/1.64 ------ Proving...
% 7.60/1.64 ------ Problem Properties
% 7.60/1.64
% 7.60/1.64
% 7.60/1.64 clauses 41
% 7.60/1.64 conjectures 1
% 7.60/1.64 EPR 14
% 7.60/1.64 Horn 35
% 7.60/1.64 unary 11
% 7.60/1.64 binary 13
% 7.60/1.64 lits 105
% 7.60/1.64 lits eq 28
% 7.60/1.64 fd_pure 0
% 7.60/1.64 fd_pseudo 0
% 7.60/1.64 fd_cond 6
% 7.60/1.64 fd_pseudo_cond 0
% 7.60/1.64 AC symbols 0
% 7.60/1.64
% 7.60/1.64 ------ Input Options Time Limit: Unbounded
% 7.60/1.64
% 7.60/1.64
% 7.60/1.64 ------
% 7.60/1.64 Current options:
% 7.60/1.64 ------
% 7.60/1.64
% 7.60/1.64
% 7.60/1.64
% 7.60/1.64
% 7.60/1.64 ------ Proving...
% 7.60/1.64
% 7.60/1.64
% 7.60/1.64 % SZS status Theorem for theBenchmark.p
% 7.60/1.64
% 7.60/1.64 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.60/1.64
% 7.60/1.64
%------------------------------------------------------------------------------