TSTP Solution File: NUM489+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM489+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:52 EDT 2023
% Result : Theorem 3.68s 1.15s
% Output : CNFRefutation 3.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 16 unt; 0 def)
% Number of atoms : 74 ( 28 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 83 ( 36 ~; 32 |; 10 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f19,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( sdtlseqdt0(X0,X1)
=> ! [X2] :
( sdtmndt0(X1,X0) = X2
<=> ( sdtpldt0(X0,X2) = X1
& aNaturalNumber0(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiff) ).
fof(f39,axiom,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
fof(f42,axiom,
sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1870) ).
fof(f43,axiom,
xr = sdtmndt0(xn,xp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1883) ).
fof(f45,conjecture,
xn = sdtpldt0(xp,xr),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f46,negated_conjecture,
xn != sdtpldt0(xp,xr),
inference(negated_conjecture,[],[f45]) ).
fof(f49,plain,
xn != sdtpldt0(xp,xr),
inference(flattening,[],[f46]) ).
fof(f77,plain,
! [X0,X1] :
( ! [X2] :
( sdtmndt0(X1,X0) = X2
<=> ( sdtpldt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f78,plain,
! [X0,X1] :
( ! [X2] :
( sdtmndt0(X1,X0) = X2
<=> ( sdtpldt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f77]) ).
fof(f120,plain,
! [X0,X1] :
( ! [X2] :
( ( sdtmndt0(X1,X0) = X2
| sdtpldt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
& ( ( sdtpldt0(X0,X2) = X1
& aNaturalNumber0(X2) )
| sdtmndt0(X1,X0) != X2 ) )
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(nnf_transformation,[],[f78]) ).
fof(f121,plain,
! [X0,X1] :
( ! [X2] :
( ( sdtmndt0(X1,X0) = X2
| sdtpldt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
& ( ( sdtpldt0(X0,X2) = X1
& aNaturalNumber0(X2) )
| sdtmndt0(X1,X0) != X2 ) )
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f120]) ).
fof(f163,plain,
! [X2,X0,X1] :
( sdtpldt0(X0,X2) = X1
| sdtmndt0(X1,X0) != X2
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f203,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f39]) ).
fof(f205,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f39]) ).
fof(f209,plain,
sdtlseqdt0(xp,xn),
inference(cnf_transformation,[],[f42]) ).
fof(f210,plain,
xr = sdtmndt0(xn,xp),
inference(cnf_transformation,[],[f43]) ).
fof(f213,plain,
xn != sdtpldt0(xp,xr),
inference(cnf_transformation,[],[f49]) ).
fof(f216,plain,
! [X0,X1] :
( sdtpldt0(X0,sdtmndt0(X1,X0)) = X1
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(equality_resolution,[],[f163]) ).
cnf(c_77,plain,
( ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| sdtpldt0(X0,sdtmndt0(X1,X0)) = X1 ),
inference(cnf_transformation,[],[f216]) ).
cnf(c_116,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f205]) ).
cnf(c_118,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f203]) ).
cnf(c_122,plain,
sdtlseqdt0(xp,xn),
inference(cnf_transformation,[],[f209]) ).
cnf(c_123,plain,
sdtmndt0(xn,xp) = xr,
inference(cnf_transformation,[],[f210]) ).
cnf(c_126,negated_conjecture,
sdtpldt0(xp,xr) != xn,
inference(cnf_transformation,[],[f213]) ).
cnf(c_6376,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| sdtpldt0(xp,sdtmndt0(xn,xp)) = xn ),
inference(superposition,[status(thm)],[c_122,c_77]) ).
cnf(c_6411,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| sdtpldt0(xp,xr) = xn ),
inference(light_normalisation,[status(thm)],[c_6376,c_123]) ).
cnf(c_6412,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6411,c_126,c_118,c_116]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM489+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Aug 25 16:21:18 EDT 2023
% 0.12/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
% 3.68/1.15 % SZS status Started for theBenchmark.p
% 3.68/1.15 % SZS status Theorem for theBenchmark.p
% 3.68/1.15
% 3.68/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.68/1.15
% 3.68/1.15 ------ iProver source info
% 3.68/1.15
% 3.68/1.15 git: date: 2023-05-31 18:12:56 +0000
% 3.68/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.68/1.15 git: non_committed_changes: false
% 3.68/1.15 git: last_make_outside_of_git: false
% 3.68/1.15
% 3.68/1.15 ------ Parsing...
% 3.68/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.68/1.15
% 3.68/1.15 ------ 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.68/1.15
% 3.68/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.68/1.15
% 3.68/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.68/1.15 ------ Proving...
% 3.68/1.15 ------ Problem Properties
% 3.68/1.15
% 3.68/1.15
% 3.68/1.15 clauses 73
% 3.68/1.15 conjectures 1
% 3.68/1.15 EPR 21
% 3.68/1.15 Horn 48
% 3.68/1.15 unary 15
% 3.68/1.15 binary 7
% 3.68/1.15 lits 268
% 3.68/1.15 lits eq 74
% 3.68/1.15 fd_pure 0
% 3.68/1.15 fd_pseudo 0
% 3.68/1.15 fd_cond 15
% 3.68/1.15 fd_pseudo_cond 11
% 3.68/1.15 AC symbols 0
% 3.68/1.15
% 3.68/1.15 ------ Schedule dynamic 5 is on
% 3.68/1.15
% 3.68/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.68/1.15
% 3.68/1.15
% 3.68/1.15 ------
% 3.68/1.15 Current options:
% 3.68/1.15 ------
% 3.68/1.15
% 3.68/1.15
% 3.68/1.15
% 3.68/1.15
% 3.68/1.15 ------ Proving...
% 3.68/1.15
% 3.68/1.15
% 3.68/1.15 % SZS status Theorem for theBenchmark.p
% 3.68/1.15
% 3.68/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.68/1.15
% 3.68/1.15
%------------------------------------------------------------------------------