TSTP Solution File: NUM469+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM469+2 : 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 : Fri May 3 02:49:26 EDT 2024
% Result : Theorem 0.49s 1.18s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> aNaturalNumber0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(f8,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sdtpldt0(sz00,X0) = X0
& sdtpldt0(X0,sz00) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_AddZero) ).
fof(f12,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_MulZero) ).
fof(f33,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1240) ).
fof(f34,axiom,
( doDivides0(xl,xn)
& ? [X0] :
( xn = sdtasdt0(xl,X0)
& aNaturalNumber0(X0) )
& doDivides0(xl,xm)
& ? [X0] :
( xm = sdtasdt0(xl,X0)
& aNaturalNumber0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1240_04) ).
fof(f35,axiom,
( sz00 != xl
=> ( sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl)))
& xn = sdtasdt0(xl,sdtsldt0(xn,xl))
& aNaturalNumber0(sdtsldt0(xn,xl))
& xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xm,xl)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1298) ).
fof(f36,conjecture,
( doDivides0(xl,sdtpldt0(xm,xn))
| ? [X0] :
( sdtasdt0(xl,X0) = sdtpldt0(xm,xn)
& aNaturalNumber0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f37,negated_conjecture,
~ ( doDivides0(xl,sdtpldt0(xm,xn))
| ? [X0] :
( sdtasdt0(xl,X0) = sdtpldt0(xm,xn)
& aNaturalNumber0(X0) ) ),
inference(negated_conjecture,[],[f36]) ).
fof(f40,plain,
( doDivides0(xl,xn)
& ? [X0] :
( xn = sdtasdt0(xl,X0)
& aNaturalNumber0(X0) )
& doDivides0(xl,xm)
& ? [X1] :
( xm = sdtasdt0(xl,X1)
& aNaturalNumber0(X1) ) ),
inference(rectify,[],[f34]) ).
fof(f42,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f43,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f42]) ).
fof(f50,plain,
! [X0] :
( ( sdtpldt0(sz00,X0) = X0
& sdtpldt0(X0,sz00) = X0 )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f56,plain,
! [X0] :
( ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f92,plain,
( ( sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl)))
& xn = sdtasdt0(xl,sdtsldt0(xn,xl))
& aNaturalNumber0(sdtsldt0(xn,xl))
& xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xm,xl)) )
| sz00 = xl ),
inference(ennf_transformation,[],[f35]) ).
fof(f93,plain,
( ~ doDivides0(xl,sdtpldt0(xm,xn))
& ! [X0] :
( sdtasdt0(xl,X0) != sdtpldt0(xm,xn)
| ~ aNaturalNumber0(X0) ) ),
inference(ennf_transformation,[],[f37]) ).
fof(f106,plain,
( ? [X0] :
( xn = sdtasdt0(xl,X0)
& aNaturalNumber0(X0) )
=> ( xn = sdtasdt0(xl,sK2)
& aNaturalNumber0(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f107,plain,
( ? [X1] :
( xm = sdtasdt0(xl,X1)
& aNaturalNumber0(X1) )
=> ( xm = sdtasdt0(xl,sK3)
& aNaturalNumber0(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f108,plain,
( doDivides0(xl,xn)
& xn = sdtasdt0(xl,sK2)
& aNaturalNumber0(sK2)
& doDivides0(xl,xm)
& xm = sdtasdt0(xl,sK3)
& aNaturalNumber0(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f40,f107,f106]) ).
fof(f112,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f116,plain,
! [X0] :
( sdtpldt0(X0,sz00) = X0
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f50]) ).
fof(f123,plain,
! [X0] :
( sz00 = sdtasdt0(sz00,X0)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f163,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f33]) ).
fof(f165,plain,
aNaturalNumber0(sK3),
inference(cnf_transformation,[],[f108]) ).
fof(f166,plain,
xm = sdtasdt0(xl,sK3),
inference(cnf_transformation,[],[f108]) ).
fof(f168,plain,
aNaturalNumber0(sK2),
inference(cnf_transformation,[],[f108]) ).
fof(f169,plain,
xn = sdtasdt0(xl,sK2),
inference(cnf_transformation,[],[f108]) ).
fof(f171,plain,
( aNaturalNumber0(sdtsldt0(xm,xl))
| sz00 = xl ),
inference(cnf_transformation,[],[f92]) ).
fof(f173,plain,
( aNaturalNumber0(sdtsldt0(xn,xl))
| sz00 = xl ),
inference(cnf_transformation,[],[f92]) ).
fof(f175,plain,
( sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl)))
| sz00 = xl ),
inference(cnf_transformation,[],[f92]) ).
fof(f176,plain,
! [X0] :
( sdtasdt0(xl,X0) != sdtpldt0(xm,xn)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f93]) ).
cnf(c_52,plain,
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X0,X1)) ),
inference(cnf_transformation,[],[f112]) ).
cnf(c_57,plain,
( ~ aNaturalNumber0(X0)
| sdtpldt0(X0,sz00) = X0 ),
inference(cnf_transformation,[],[f116]) ).
cnf(c_62,plain,
( ~ aNaturalNumber0(X0)
| sdtasdt0(sz00,X0) = sz00 ),
inference(cnf_transformation,[],[f123]) ).
cnf(c_102,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f163]) ).
cnf(c_105,plain,
sdtasdt0(xl,sK2) = xn,
inference(cnf_transformation,[],[f169]) ).
cnf(c_106,plain,
aNaturalNumber0(sK2),
inference(cnf_transformation,[],[f168]) ).
cnf(c_108,plain,
sdtasdt0(xl,sK3) = xm,
inference(cnf_transformation,[],[f166]) ).
cnf(c_109,plain,
aNaturalNumber0(sK3),
inference(cnf_transformation,[],[f165]) ).
cnf(c_110,plain,
( sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) = sdtpldt0(xm,xn)
| sz00 = xl ),
inference(cnf_transformation,[],[f175]) ).
cnf(c_112,plain,
( sz00 = xl
| aNaturalNumber0(sdtsldt0(xn,xl)) ),
inference(cnf_transformation,[],[f173]) ).
cnf(c_114,plain,
( sz00 = xl
| aNaturalNumber0(sdtsldt0(xm,xl)) ),
inference(cnf_transformation,[],[f171]) ).
cnf(c_116,negated_conjecture,
( sdtasdt0(xl,X0) != sdtpldt0(xm,xn)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f176]) ).
cnf(c_1766,plain,
sdtpldt0(xm,xn) = sP0_iProver_def,
definition ).
cnf(c_1767,negated_conjecture,
( sdtasdt0(xl,X0) != sP0_iProver_def
| ~ aNaturalNumber0(X0) ),
inference(demodulation,[status(thm)],[c_116,c_1766]) ).
cnf(c_2720,plain,
( xm != sP0_iProver_def
| ~ aNaturalNumber0(sK3) ),
inference(superposition,[status(thm)],[c_108,c_1767]) ).
cnf(c_2721,plain,
xm != sP0_iProver_def,
inference(forward_subsumption_resolution,[status(thm)],[c_2720,c_109]) ).
cnf(c_2754,plain,
sdtpldt0(xm,sz00) = xm,
inference(superposition,[status(thm)],[c_102,c_57]) ).
cnf(c_2807,plain,
sdtasdt0(sz00,sK2) = sz00,
inference(superposition,[status(thm)],[c_106,c_62]) ).
cnf(c_4323,plain,
( sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) = sP0_iProver_def
| sz00 = xl ),
inference(light_normalisation,[status(thm)],[c_110,c_1766]) ).
cnf(c_4331,plain,
( ~ aNaturalNumber0(sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl)))
| sz00 = xl ),
inference(superposition,[status(thm)],[c_4323,c_1767]) ).
cnf(c_4376,plain,
( ~ aNaturalNumber0(sdtsldt0(xn,xl))
| ~ aNaturalNumber0(sdtsldt0(xm,xl))
| sz00 = xl ),
inference(superposition,[status(thm)],[c_52,c_4331]) ).
cnf(c_4380,plain,
sz00 = xl,
inference(global_subsumption_just,[status(thm)],[c_4376,c_114,c_112,c_4376]) ).
cnf(c_4405,plain,
sdtasdt0(sz00,sK2) = xn,
inference(demodulation,[status(thm)],[c_105,c_4380]) ).
cnf(c_4411,plain,
sz00 = xn,
inference(light_normalisation,[status(thm)],[c_4405,c_2807]) ).
cnf(c_4427,plain,
sdtpldt0(xm,sz00) = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_1766,c_4411]) ).
cnf(c_4429,plain,
xm = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_4427,c_2754]) ).
cnf(c_4430,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4429,c_2721]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM469+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n018.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 19:33:31 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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
% 0.49/1.18 % SZS status Started for theBenchmark.p
% 0.49/1.18 % SZS status Theorem for theBenchmark.p
% 0.49/1.18
% 0.49/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.49/1.18
% 0.49/1.18 ------ iProver source info
% 0.49/1.18
% 0.49/1.18 git: date: 2024-05-02 19:28:25 +0000
% 0.49/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.49/1.18 git: non_committed_changes: false
% 0.49/1.18
% 0.49/1.18 ------ Parsing...
% 0.49/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.49/1.18
% 0.49/1.18 ------ 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
% 0.49/1.18
% 0.49/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.49/1.18
% 0.49/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.49/1.18 ------ Proving...
% 0.49/1.18 ------ Problem Properties
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18 clauses 64
% 0.49/1.18 conjectures 2
% 0.49/1.18 EPR 17
% 0.49/1.18 Horn 46
% 0.49/1.18 unary 14
% 0.49/1.18 binary 13
% 0.49/1.18 lits 205
% 0.49/1.18 lits eq 61
% 0.49/1.18 fd_pure 0
% 0.49/1.18 fd_pseudo 0
% 0.49/1.18 fd_cond 6
% 0.49/1.18 fd_pseudo_cond 9
% 0.49/1.18 AC symbols 0
% 0.49/1.18
% 0.49/1.18 ------ Schedule dynamic 5 is on
% 0.49/1.18
% 0.49/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18 ------
% 0.49/1.18 Current options:
% 0.49/1.18 ------
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18 ------ Proving...
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18 % SZS status Theorem for theBenchmark.p
% 0.49/1.18
% 0.49/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.49/1.18
% 0.70/1.18
%------------------------------------------------------------------------------