TSTP Solution File: NUM429+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM429+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:14 EDT 2024
% Result : Theorem 2.74s 1.21s
% Output : CNFRefutation 2.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 50 ( 18 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 43 ( 10 ~; 4 |; 27 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 2 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f23,axiom,
( sdteqdtlpzmzozddtrp0(xb,xc,xq)
& aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
& ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
& aInteger0(X0) )
& sdteqdtlpzmzozddtrp0(xa,xb,xq)
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__853) ).
fof(f24,conjecture,
? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f25,negated_conjecture,
~ ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ),
inference(negated_conjecture,[],[f24]) ).
fof(f27,plain,
( sdteqdtlpzmzozddtrp0(xb,xc,xq)
& aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
& ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
& aInteger0(X0) )
& sdteqdtlpzmzozddtrp0(xa,xb,xq)
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ? [X1] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X1)
& aInteger0(X1) ) ),
inference(rectify,[],[f23]) ).
fof(f57,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f64,plain,
( ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
& aInteger0(X0) )
=> ( sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,sK1)
& aInteger0(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f65,plain,
( ? [X1] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X1)
& aInteger0(X1) )
=> ( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK2)
& aInteger0(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f66,plain,
( sdteqdtlpzmzozddtrp0(xb,xc,xq)
& aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
& sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,sK1)
& aInteger0(sK1)
& sdteqdtlpzmzozddtrp0(xa,xb,xq)
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK2)
& aInteger0(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f27,f65,f64]) ).
fof(f103,plain,
aInteger0(sK2),
inference(cnf_transformation,[],[f66]) ).
fof(f104,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK2),
inference(cnf_transformation,[],[f66]) ).
fof(f111,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_91,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK2),
inference(cnf_transformation,[],[f104]) ).
cnf(c_92,plain,
aInteger0(sK2),
inference(cnf_transformation,[],[f103]) ).
cnf(c_93,negated_conjecture,
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f111]) ).
cnf(c_410,plain,
( sdtasdt0(xq,X0) != sdtasdt0(xq,sK2)
| ~ aInteger0(X0) ),
inference(light_normalisation,[status(thm)],[c_93,c_91]) ).
cnf(c_1369,plain,
~ aInteger0(sK2),
inference(equality_resolution,[status(thm)],[c_410]) ).
cnf(c_1370,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1369,c_92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM429+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 2 19:41:22 EDT 2024
% 0.14/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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.74/1.21 % SZS status Started for theBenchmark.p
% 2.74/1.21 % SZS status Theorem for theBenchmark.p
% 2.74/1.21
% 2.74/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.74/1.21
% 2.74/1.21 ------ iProver source info
% 2.74/1.21
% 2.74/1.21 git: date: 2024-05-02 19:28:25 +0000
% 2.74/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.74/1.21 git: non_committed_changes: false
% 2.74/1.21
% 2.74/1.21 ------ Parsing...
% 2.74/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.74/1.21
% 2.74/1.21 ------ Preprocessing... sup_sim: 3 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.74/1.21
% 2.74/1.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.74/1.21
% 2.74/1.21 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.74/1.21 ------ Proving...
% 2.74/1.21 ------ Problem Properties
% 2.74/1.21
% 2.74/1.21
% 2.74/1.21 clauses 45
% 2.74/1.21 conjectures 0
% 2.74/1.21 EPR 15
% 2.74/1.21 Horn 39
% 2.74/1.21 unary 15
% 2.74/1.21 binary 13
% 2.74/1.21 lits 109
% 2.74/1.21 lits eq 29
% 2.74/1.21 fd_pure 0
% 2.74/1.21 fd_pseudo 0
% 2.74/1.21 fd_cond 6
% 2.74/1.21 fd_pseudo_cond 0
% 2.74/1.21 AC symbols 0
% 2.74/1.21
% 2.74/1.21 ------ Schedule dynamic 5 is on
% 2.74/1.21
% 2.74/1.21 ------ no conjectures: strip conj schedule
% 2.74/1.21
% 2.74/1.21 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.74/1.21
% 2.74/1.21
% 2.74/1.21 ------
% 2.74/1.21 Current options:
% 2.74/1.21 ------
% 2.74/1.21
% 2.74/1.21
% 2.74/1.21
% 2.74/1.21
% 2.74/1.21 ------ Proving...
% 2.74/1.21
% 2.74/1.21
% 2.74/1.21 % SZS status Theorem for theBenchmark.p
% 2.74/1.21
% 2.74/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.74/1.21
% 2.74/1.21
%------------------------------------------------------------------------------