TSTP Solution File: NUM432+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM432+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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:25 EDT 2023
% Result : Theorem 3.84s 1.16s
% Output : CNFRefutation 3.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 76 ( 25 unt; 0 def)
% Number of atoms : 256 ( 77 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 303 ( 123 ~; 128 |; 39 &)
% ( 5 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn; 65 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntZero) ).
fof(f5,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> aInteger0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntPlus) ).
fof(f6,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> aInteger0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntMult) ).
fof(f15,axiom,
! [X0] :
( aInteger0(X0)
=> ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulZero) ).
fof(f17,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> ( sz00 = sdtasdt0(X0,X1)
=> ( sz00 = X1
| sz00 = X0 ) ) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',mEquMod) ).
fof(f22,axiom,
( aInteger0(xc)
& sz00 != xq
& aInteger0(xq)
& aInteger0(xb)
& aInteger0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__818) ).
fof(f24,axiom,
( sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb))
& aInteger0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__876) ).
fof(f25,axiom,
( sdtasdt0(xq,xm) = sdtpldt0(xb,smndt0(xc))
& aInteger0(xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__899) ).
fof(f26,axiom,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__924) ).
fof(f27,conjecture,
sdteqdtlpzmzozddtrp0(xa,xc,xq),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f28,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(negated_conjecture,[],[f27]) ).
fof(f30,plain,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(flattening,[],[f28]) ).
fof(f32,plain,
! [X0,X1] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f33,plain,
! [X0,X1] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f35,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f34]) ).
fof(f49,plain,
! [X0] :
( ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) )
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f51,plain,
! [X0,X1] :
( sz00 = X1
| sz00 = X0
| sz00 != sdtasdt0(X0,X1)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f17]) ).
fof(f52,plain,
! [X0,X1] :
( sz00 = X1
| sz00 = X0
| sz00 != sdtasdt0(X0,X1)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f51]) ).
fof(f53,plain,
! [X0] :
( ! [X1] :
( aDivisorOf0(X1,X0)
<=> ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& sz00 != X1
& aInteger0(X1) ) )
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f54,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(f55,plain,
! [X0,X1,X2] :
( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
| sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f54]) ).
fof(f60,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,[],[f53]) ).
fof(f61,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,[],[f60]) ).
fof(f62,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,[],[f61]) ).
fof(f63,plain,
! [X0,X1] :
( ? [X3] :
( sdtasdt0(X1,X3) = X0
& aInteger0(X3) )
=> ( sdtasdt0(X1,sK0(X0,X1)) = X0
& aInteger0(sK0(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f64,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])],[f62,f63]) ).
fof(f65,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,[],[f55]) ).
fof(f66,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f69,plain,
! [X0,X1] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f70,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f83,plain,
! [X0] :
( sz00 = sdtasdt0(X0,sz00)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f49]) ).
fof(f87,plain,
! [X0,X1] :
( sz00 = X1
| sz00 = X0
| sz00 != sdtasdt0(X0,X1)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f92,plain,
! [X2,X0,X1] :
( aDivisorOf0(X1,X0)
| sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2)
| sz00 = X1
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f64]) ).
fof(f94,plain,
! [X2,X0,X1] :
( sdteqdtlpzmzozddtrp0(X0,X1,X2)
| ~ aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f97,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f22]) ).
fof(f99,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f22]) ).
fof(f100,plain,
sz00 != xq,
inference(cnf_transformation,[],[f22]) ).
fof(f101,plain,
aInteger0(xc),
inference(cnf_transformation,[],[f22]) ).
fof(f104,plain,
aInteger0(xn),
inference(cnf_transformation,[],[f24]) ).
fof(f106,plain,
aInteger0(xm),
inference(cnf_transformation,[],[f25]) ).
fof(f108,plain,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
inference(cnf_transformation,[],[f26]) ).
fof(f109,plain,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(cnf_transformation,[],[f30]) ).
fof(f110,plain,
! [X2,X1] :
( aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| sz00 = X1
| ~ aInteger0(X1)
| ~ aInteger0(sdtasdt0(X1,X2)) ),
inference(equality_resolution,[],[f92]) ).
cnf(c_49,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f66]) ).
cnf(c_52,plain,
( ~ aInteger0(X0)
| ~ aInteger0(X1)
| aInteger0(sdtpldt0(X0,X1)) ),
inference(cnf_transformation,[],[f69]) ).
cnf(c_53,plain,
( ~ aInteger0(X0)
| ~ aInteger0(X1)
| aInteger0(sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f70]) ).
cnf(c_67,plain,
( ~ aInteger0(X0)
| sdtasdt0(X0,sz00) = sz00 ),
inference(cnf_transformation,[],[f83]) ).
cnf(c_70,plain,
( sdtasdt0(X0,X1) != sz00
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| X0 = sz00
| X1 = sz00 ),
inference(cnf_transformation,[],[f87]) ).
cnf(c_71,plain,
( ~ aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| X0 = sz00
| aDivisorOf0(X0,sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f110]) ).
cnf(c_76,plain,
( ~ aDivisorOf0(X0,sdtpldt0(X1,smndt0(X2)))
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| X0 = sz00
| sdteqdtlpzmzozddtrp0(X1,X2,X0) ),
inference(cnf_transformation,[],[f94]) ).
cnf(c_80,plain,
aInteger0(xc),
inference(cnf_transformation,[],[f101]) ).
cnf(c_81,plain,
sz00 != xq,
inference(cnf_transformation,[],[f100]) ).
cnf(c_82,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f99]) ).
cnf(c_84,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f97]) ).
cnf(c_88,plain,
aInteger0(xn),
inference(cnf_transformation,[],[f104]) ).
cnf(c_90,plain,
aInteger0(xm),
inference(cnf_transformation,[],[f106]) ).
cnf(c_91,plain,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
inference(cnf_transformation,[],[f108]) ).
cnf(c_92,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(cnf_transformation,[],[f109]) ).
cnf(c_95,plain,
( ~ aInteger0(sz00)
| sdtasdt0(sz00,sz00) = sz00 ),
inference(instantiation,[status(thm)],[c_67]) ).
cnf(c_109,plain,
( sdtasdt0(sz00,sz00) != sz00
| ~ aInteger0(sz00)
| sz00 = sz00 ),
inference(instantiation,[status(thm)],[c_70]) ).
cnf(c_115,plain,
( ~ aInteger0(X0)
| ~ aInteger0(X1)
| X0 = sz00
| aDivisorOf0(X0,sdtasdt0(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_71,c_53,c_71]) ).
cnf(c_707,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_1349,plain,
( sz00 != X0
| xq != X0
| sz00 = xq ),
inference(instantiation,[status(thm)],[c_707]) ).
cnf(c_1350,plain,
( sz00 != sz00
| xq != sz00
| sz00 = xq ),
inference(instantiation,[status(thm)],[c_1349]) ).
cnf(c_1354,plain,
( ~ aDivisorOf0(xq,sdtpldt0(X0,smndt0(X1)))
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(xq)
| xq = sz00
| sdteqdtlpzmzozddtrp0(X0,X1,xq) ),
inference(instantiation,[status(thm)],[c_76]) ).
cnf(c_1530,plain,
( ~ aInteger0(sdtpldt0(xn,xm))
| ~ aInteger0(xq)
| aInteger0(sdtpldt0(xa,smndt0(xc))) ),
inference(superposition,[status(thm)],[c_91,c_53]) ).
cnf(c_1531,plain,
( ~ aInteger0(sdtpldt0(xn,xm))
| aInteger0(sdtpldt0(xa,smndt0(xc))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1530,c_82]) ).
cnf(c_1797,plain,
( ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ~ aInteger0(xc)
| ~ aInteger0(xq)
| ~ aInteger0(xa)
| xq = sz00
| sdteqdtlpzmzozddtrp0(xa,xc,xq) ),
inference(instantiation,[status(thm)],[c_1354]) ).
cnf(c_1933,plain,
( ~ aInteger0(sdtpldt0(xn,xm))
| ~ aInteger0(xq)
| sz00 = xq
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc))) ),
inference(superposition,[status(thm)],[c_91,c_115]) ).
cnf(c_2026,plain,
( ~ aInteger0(sdtpldt0(xn,xm))
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1933,c_81,c_82]) ).
cnf(c_4958,plain,
~ aInteger0(sdtpldt0(xn,xm)),
inference(global_subsumption_just,[status(thm)],[c_1531,c_84,c_82,c_80,c_49,c_92,c_81,c_95,c_109,c_1350,c_1797,c_2026]) ).
cnf(c_4960,plain,
( ~ aInteger0(xn)
| ~ aInteger0(xm) ),
inference(superposition,[status(thm)],[c_52,c_4958]) ).
cnf(c_4961,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4960,c_90,c_88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM432+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n018.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 : Fri Aug 25 17:35:14 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.84/1.16 % SZS status Started for theBenchmark.p
% 3.84/1.16 % SZS status Theorem for theBenchmark.p
% 3.84/1.16
% 3.84/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.84/1.16
% 3.84/1.16 ------ iProver source info
% 3.84/1.16
% 3.84/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.84/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.84/1.16 git: non_committed_changes: false
% 3.84/1.16 git: last_make_outside_of_git: false
% 3.84/1.16
% 3.84/1.16 ------ Parsing...
% 3.84/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.84/1.16
% 3.84/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.84/1.16
% 3.84/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.84/1.16
% 3.84/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.84/1.16 ------ Proving...
% 3.84/1.16 ------ Problem Properties
% 3.84/1.16
% 3.84/1.16
% 3.84/1.16 clauses 44
% 3.84/1.16 conjectures 1
% 3.84/1.16 EPR 16
% 3.84/1.16 Horn 38
% 3.84/1.16 unary 15
% 3.84/1.16 binary 12
% 3.84/1.16 lits 107
% 3.84/1.16 lits eq 29
% 3.84/1.16 fd_pure 0
% 3.84/1.16 fd_pseudo 0
% 3.84/1.16 fd_cond 6
% 3.84/1.16 fd_pseudo_cond 0
% 3.84/1.16 AC symbols 0
% 3.84/1.16
% 3.84/1.16 ------ Schedule dynamic 5 is on
% 3.84/1.16
% 3.84/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.84/1.16
% 3.84/1.16
% 3.84/1.16 ------
% 3.84/1.16 Current options:
% 3.84/1.16 ------
% 3.84/1.16
% 3.84/1.16
% 3.84/1.16
% 3.84/1.16
% 3.84/1.16 ------ Proving...
% 3.84/1.16
% 3.84/1.16
% 3.84/1.16 % SZS status Theorem for theBenchmark.p
% 3.84/1.16
% 3.84/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.84/1.16
% 3.84/1.16
%------------------------------------------------------------------------------