TSTP Solution File: NUM464+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM464+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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:40 EDT 2023
% Result : Theorem 2.73s 1.17s
% Output : CNFRefutation 2.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 14 unt; 0 def)
% Number of atoms : 76 ( 37 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 77 ( 34 ~; 26 |; 13 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn; 10 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(f3,axiom,
( sz00 != sz10
& aNaturalNumber0(sz10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(f8,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sdtpldt0(sz00,X0) = X0
& sdtpldt0(X0,sz00) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_AddZero) ).
fof(f26,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( ( sdtlseqdt0(sz10,X0)
& sz10 != X0 )
| sz10 = X0
| sz00 = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLENTr) ).
fof(f27,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__987) ).
fof(f28,conjecture,
( sz00 != xm
=> ( sdtlseqdt0(sz10,xm)
| ? [X0] :
( xm = sdtpldt0(sz10,X0)
& aNaturalNumber0(X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f29,negated_conjecture,
~ ( sz00 != xm
=> ( sdtlseqdt0(sz10,xm)
| ? [X0] :
( xm = sdtpldt0(sz10,X0)
& aNaturalNumber0(X0) ) ) ),
inference(negated_conjecture,[],[f28]) ).
fof(f39,plain,
! [X0] :
( ( sdtpldt0(sz00,X0) = X0
& sdtpldt0(X0,sz00) = X0 )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f71,plain,
! [X0] :
( ( sdtlseqdt0(sz10,X0)
& sz10 != X0 )
| sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f72,plain,
! [X0] :
( ( sdtlseqdt0(sz10,X0)
& sz10 != X0 )
| sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f71]) ).
fof(f73,plain,
( ~ sdtlseqdt0(sz10,xm)
& ! [X0] :
( xm != sdtpldt0(sz10,X0)
| ~ aNaturalNumber0(X0) )
& sz00 != xm ),
inference(ennf_transformation,[],[f29]) ).
fof(f74,plain,
( ~ sdtlseqdt0(sz10,xm)
& ! [X0] :
( xm != sdtpldt0(sz10,X0)
| ~ aNaturalNumber0(X0) )
& sz00 != xm ),
inference(flattening,[],[f73]) ).
fof(f81,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f82,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[],[f3]) ).
fof(f88,plain,
! [X0] :
( sdtpldt0(X0,sz00) = X0
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f39]) ).
fof(f125,plain,
! [X0] :
( sdtlseqdt0(sz10,X0)
| sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f126,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f27]) ).
fof(f128,plain,
sz00 != xm,
inference(cnf_transformation,[],[f74]) ).
fof(f129,plain,
! [X0] :
( xm != sdtpldt0(sz10,X0)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f74]) ).
fof(f130,plain,
~ sdtlseqdt0(sz10,xm),
inference(cnf_transformation,[],[f74]) ).
cnf(c_49,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[],[f81]) ).
cnf(c_51,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[],[f82]) ).
cnf(c_57,plain,
( ~ aNaturalNumber0(X0)
| sdtpldt0(X0,sz00) = X0 ),
inference(cnf_transformation,[],[f88]) ).
cnf(c_92,plain,
( ~ aNaturalNumber0(X0)
| X0 = sz00
| X0 = sz10
| sdtlseqdt0(sz10,X0) ),
inference(cnf_transformation,[],[f125]) ).
cnf(c_94,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f126]) ).
cnf(c_95,negated_conjecture,
~ sdtlseqdt0(sz10,xm),
inference(cnf_transformation,[],[f130]) ).
cnf(c_96,negated_conjecture,
( sdtpldt0(sz10,X0) != xm
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f129]) ).
cnf(c_97,negated_conjecture,
sz00 != xm,
inference(cnf_transformation,[],[f128]) ).
cnf(c_2074,plain,
sdtpldt0(sz10,sz00) = sz10,
inference(superposition,[status(thm)],[c_51,c_57]) ).
cnf(c_2094,plain,
( sz10 != xm
| ~ aNaturalNumber0(sz00) ),
inference(superposition,[status(thm)],[c_2074,c_96]) ).
cnf(c_2095,plain,
sz10 != xm,
inference(forward_subsumption_resolution,[status(thm)],[c_2094,c_49]) ).
cnf(c_2602,plain,
( ~ aNaturalNumber0(xm)
| sz00 = xm
| sz10 = xm ),
inference(superposition,[status(thm)],[c_92,c_95]) ).
cnf(c_2603,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2602,c_2095,c_97,c_94]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM464+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n012.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 15:39:26 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.73/1.17 % SZS status Started for theBenchmark.p
% 2.73/1.17 % SZS status Theorem for theBenchmark.p
% 2.73/1.17
% 2.73/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.73/1.17
% 2.73/1.17 ------ iProver source info
% 2.73/1.17
% 2.73/1.17 git: date: 2023-05-31 18:12:56 +0000
% 2.73/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.73/1.17 git: non_committed_changes: false
% 2.73/1.17 git: last_make_outside_of_git: false
% 2.73/1.17
% 2.73/1.17 ------ Parsing...
% 2.73/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.73/1.17
% 2.73/1.17 ------ 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
% 2.73/1.17
% 2.73/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.73/1.17
% 2.73/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.73/1.17 ------ Proving...
% 2.73/1.17 ------ Problem Properties
% 2.73/1.17
% 2.73/1.17
% 2.73/1.17 clauses 44
% 2.73/1.17 conjectures 3
% 2.73/1.17 EPR 12
% 2.73/1.17 Horn 35
% 2.73/1.17 unary 7
% 2.73/1.17 binary 8
% 2.73/1.17 lits 153
% 2.73/1.17 lits eq 44
% 2.73/1.17 fd_pure 0
% 2.73/1.17 fd_pseudo 0
% 2.73/1.17 fd_cond 4
% 2.73/1.17 fd_pseudo_cond 9
% 2.73/1.17 AC symbols 0
% 2.73/1.17
% 2.73/1.17 ------ Schedule dynamic 5 is on
% 2.73/1.17
% 2.73/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.73/1.17
% 2.73/1.17
% 2.73/1.17 ------
% 2.73/1.17 Current options:
% 2.73/1.17 ------
% 2.73/1.17
% 2.73/1.17
% 2.73/1.17
% 2.73/1.17
% 2.73/1.17 ------ Proving...
% 2.73/1.17
% 2.73/1.17
% 2.73/1.17 % SZS status Theorem for theBenchmark.p
% 2.73/1.17
% 2.73/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.73/1.17
% 2.73/1.17
%------------------------------------------------------------------------------