TSTP Solution File: NUM477+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM477+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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:29 EDT 2024
% Result : Theorem 3.89s 1.21s
% Output : CNFRefutation 3.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 16 unt; 0 def)
% Number of atoms : 73 ( 29 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 65 ( 25 ~; 21 |; 15 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 12 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_MulZero) ).
fof(f27,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( sz00 != X0
=> sdtlseqdt0(X1,sdtasdt0(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMonMul2) ).
fof(f35,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1494) ).
fof(f36,axiom,
( sz00 != xn
& doDivides0(xm,xn)
& ? [X0] :
( xn = sdtasdt0(xm,X0)
& aNaturalNumber0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1494_04) ).
fof(f37,conjecture,
( sdtlseqdt0(xm,xn)
| ? [X0] :
( xn = sdtpldt0(xm,X0)
& aNaturalNumber0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f38,negated_conjecture,
~ ( sdtlseqdt0(xm,xn)
| ? [X0] :
( xn = sdtpldt0(xm,X0)
& aNaturalNumber0(X0) ) ),
inference(negated_conjecture,[],[f37]) ).
fof(f56,plain,
! [X0] :
( ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f84,plain,
! [X0,X1] :
( sdtlseqdt0(X1,sdtasdt0(X1,X0))
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f27]) ).
fof(f85,plain,
! [X0,X1] :
( sdtlseqdt0(X1,sdtasdt0(X1,X0))
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f84]) ).
fof(f96,plain,
( ~ sdtlseqdt0(xm,xn)
& ! [X0] :
( xn != sdtpldt0(xm,X0)
| ~ aNaturalNumber0(X0) ) ),
inference(ennf_transformation,[],[f38]) ).
fof(f109,plain,
( ? [X0] :
( xn = sdtasdt0(xm,X0)
& aNaturalNumber0(X0) )
=> ( xn = sdtasdt0(xm,sK2)
& aNaturalNumber0(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f110,plain,
( sz00 != xn
& doDivides0(xm,xn)
& xn = sdtasdt0(xm,sK2)
& aNaturalNumber0(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f36,f109]) ).
fof(f124,plain,
! [X0] :
( sz00 = sdtasdt0(X0,sz00)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f156,plain,
! [X0,X1] :
( sdtlseqdt0(X1,sdtasdt0(X1,X0))
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f85]) ).
fof(f166,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f35]) ).
fof(f168,plain,
aNaturalNumber0(sK2),
inference(cnf_transformation,[],[f110]) ).
fof(f169,plain,
xn = sdtasdt0(xm,sK2),
inference(cnf_transformation,[],[f110]) ).
fof(f171,plain,
sz00 != xn,
inference(cnf_transformation,[],[f110]) ).
fof(f173,plain,
~ sdtlseqdt0(xm,xn),
inference(cnf_transformation,[],[f96]) ).
cnf(c_63,plain,
( ~ aNaturalNumber0(X0)
| sdtasdt0(X0,sz00) = sz00 ),
inference(cnf_transformation,[],[f124]) ).
cnf(c_93,plain,
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| X0 = sz00
| sdtlseqdt0(X1,sdtasdt0(X1,X0)) ),
inference(cnf_transformation,[],[f156]) ).
cnf(c_104,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f166]) ).
cnf(c_105,plain,
sz00 != xn,
inference(cnf_transformation,[],[f171]) ).
cnf(c_107,plain,
sdtasdt0(xm,sK2) = xn,
inference(cnf_transformation,[],[f169]) ).
cnf(c_108,plain,
aNaturalNumber0(sK2),
inference(cnf_transformation,[],[f168]) ).
cnf(c_109,negated_conjecture,
~ sdtlseqdt0(xm,xn),
inference(cnf_transformation,[],[f173]) ).
cnf(c_1766,negated_conjecture,
~ sdtlseqdt0(xm,xn),
inference(demodulation,[status(thm)],[c_109]) ).
cnf(c_2773,plain,
sdtasdt0(xm,sz00) = sz00,
inference(superposition,[status(thm)],[c_104,c_63]) ).
cnf(c_3383,plain,
( ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(sK2)
| sz00 = sK2
| sdtlseqdt0(xm,xn) ),
inference(superposition,[status(thm)],[c_107,c_93]) ).
cnf(c_3407,plain,
sz00 = sK2,
inference(forward_subsumption_resolution,[status(thm)],[c_3383,c_1766,c_108,c_104]) ).
cnf(c_3419,plain,
sdtasdt0(xm,sz00) = xn,
inference(demodulation,[status(thm)],[c_107,c_3407]) ).
cnf(c_3421,plain,
sz00 = xn,
inference(light_normalisation,[status(thm)],[c_3419,c_2773]) ).
cnf(c_3422,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3421,c_105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM477+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n016.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 20:01:45 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 3.89/1.21 % SZS status Started for theBenchmark.p
% 3.89/1.21 % SZS status Theorem for theBenchmark.p
% 3.89/1.21
% 3.89/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.89/1.21
% 3.89/1.21 ------ iProver source info
% 3.89/1.21
% 3.89/1.21 git: date: 2024-05-02 19:28:25 +0000
% 3.89/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.89/1.21 git: non_committed_changes: false
% 3.89/1.21
% 3.89/1.21 ------ Parsing...
% 3.89/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.89/1.21
% 3.89/1.21 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.89/1.21
% 3.89/1.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.89/1.21
% 3.89/1.21 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.89/1.21 ------ Proving...
% 3.89/1.21 ------ Problem Properties
% 3.89/1.21
% 3.89/1.21
% 3.89/1.21 clauses 57
% 3.89/1.21 conjectures 2
% 3.89/1.21 EPR 15
% 3.89/1.21 Horn 44
% 3.89/1.21 unary 10
% 3.89/1.21 binary 8
% 3.89/1.21 lits 203
% 3.89/1.21 lits eq 52
% 3.89/1.21 fd_pure 0
% 3.89/1.21 fd_pseudo 0
% 3.89/1.21 fd_cond 6
% 3.89/1.21 fd_pseudo_cond 9
% 3.89/1.21 AC symbols 0
% 3.89/1.21
% 3.89/1.21 ------ Schedule dynamic 5 is on
% 3.89/1.21
% 3.89/1.21 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.89/1.21
% 3.89/1.21
% 3.89/1.21 ------
% 3.89/1.21 Current options:
% 3.89/1.21 ------
% 3.89/1.21
% 3.89/1.21
% 3.89/1.21
% 3.89/1.21
% 3.89/1.21 ------ Proving...
% 3.89/1.21
% 3.89/1.21
% 3.89/1.21 % SZS status Theorem for theBenchmark.p
% 3.89/1.21
% 3.89/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.89/1.21
% 3.89/1.21
%------------------------------------------------------------------------------