TSTP Solution File: NUM457+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM457+1 : 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:22 EDT 2024
% Result : Theorem 3.62s 1.22s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC) ).
fof(f12,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_MulZero) ).
fof(f15,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sz00 != X0
=> ! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtasdt0(X1,X0) = sdtasdt0(X2,X0)
| sdtasdt0(X0,X1) = sdtasdt0(X0,X2) )
=> X1 = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulCanc) ).
fof(f17,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__624) ).
fof(f18,conjecture,
( sz00 = sdtasdt0(xm,xn)
=> ( sz00 = xn
| sz00 = xm ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f19,negated_conjecture,
~ ( sz00 = sdtasdt0(xm,xn)
=> ( sz00 = xn
| sz00 = xm ) ),
inference(negated_conjecture,[],[f18]) ).
fof(f35,plain,
! [X0] :
( ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f40,plain,
! [X0] :
( ! [X1,X2] :
( X1 = X2
| ( sdtasdt0(X1,X0) != sdtasdt0(X2,X0)
& sdtasdt0(X0,X1) != sdtasdt0(X0,X2) )
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) )
| sz00 = X0
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f41,plain,
! [X0] :
( ! [X1,X2] :
( X1 = X2
| ( sdtasdt0(X1,X0) != sdtasdt0(X2,X0)
& sdtasdt0(X0,X1) != sdtasdt0(X0,X2) )
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) )
| sz00 = X0
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f40]) ).
fof(f44,plain,
( sz00 != xn
& sz00 != xm
& sz00 = sdtasdt0(xm,xn) ),
inference(ennf_transformation,[],[f19]) ).
fof(f45,plain,
( sz00 != xn
& sz00 != xm
& sz00 = sdtasdt0(xm,xn) ),
inference(flattening,[],[f44]) ).
fof(f46,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f60,plain,
! [X0] :
( sz00 = sdtasdt0(sz00,X0)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f66,plain,
! [X2,X0,X1] :
( X1 = X2
| sdtasdt0(X1,X0) != sdtasdt0(X2,X0)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sz00 = X0
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f69,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f17]) ).
fof(f70,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f17]) ).
fof(f71,plain,
sz00 = sdtasdt0(xm,xn),
inference(cnf_transformation,[],[f45]) ).
fof(f72,plain,
sz00 != xm,
inference(cnf_transformation,[],[f45]) ).
fof(f73,plain,
sz00 != xn,
inference(cnf_transformation,[],[f45]) ).
cnf(c_49,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[],[f46]) ).
cnf(c_62,plain,
( ~ aNaturalNumber0(X0)
| sdtasdt0(sz00,X0) = sz00 ),
inference(cnf_transformation,[],[f60]) ).
cnf(c_68,plain,
( sdtasdt0(X0,X1) != sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| X0 = X2
| X1 = sz00 ),
inference(cnf_transformation,[],[f66]) ).
cnf(c_72,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f70]) ).
cnf(c_73,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f69]) ).
cnf(c_74,negated_conjecture,
sz00 != xn,
inference(cnf_transformation,[],[f73]) ).
cnf(c_75,negated_conjecture,
sz00 != xm,
inference(cnf_transformation,[],[f72]) ).
cnf(c_76,negated_conjecture,
sdtasdt0(xm,xn) = sz00,
inference(cnf_transformation,[],[f71]) ).
cnf(c_392,plain,
sdtasdt0(xm,xn) = sP0_iProver_def,
definition ).
cnf(c_393,negated_conjecture,
sP0_iProver_def = sz00,
inference(demodulation,[status(thm)],[c_76,c_392]) ).
cnf(c_394,negated_conjecture,
sz00 != xm,
inference(demodulation,[status(thm)],[c_75]) ).
cnf(c_395,negated_conjecture,
sz00 != xn,
inference(demodulation,[status(thm)],[c_74]) ).
cnf(c_776,plain,
xm != sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_394,c_393]) ).
cnf(c_777,plain,
xn != sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_395,c_393]) ).
cnf(c_778,plain,
aNaturalNumber0(sP0_iProver_def),
inference(light_normalisation,[status(thm)],[c_49,c_393]) ).
cnf(c_812,plain,
( ~ aNaturalNumber0(X0)
| sdtasdt0(sP0_iProver_def,X0) = sP0_iProver_def ),
inference(light_normalisation,[status(thm)],[c_62,c_393]) ).
cnf(c_818,plain,
sdtasdt0(sP0_iProver_def,xn) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_72,c_812]) ).
cnf(c_2049,plain,
( sdtasdt0(X0,X1) != sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| X0 = X2
| X1 = sP0_iProver_def ),
inference(light_normalisation,[status(thm)],[c_68,c_393]) ).
cnf(c_2089,plain,
( sdtasdt0(X0,xn) != sP0_iProver_def
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(sP0_iProver_def)
| X0 = sP0_iProver_def
| xn = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_818,c_2049]) ).
cnf(c_2110,plain,
( sdtasdt0(X0,xn) != sP0_iProver_def
| ~ aNaturalNumber0(X0)
| X0 = sP0_iProver_def ),
inference(forward_subsumption_resolution,[status(thm)],[c_2089,c_777,c_778,c_72]) ).
cnf(c_2763,plain,
( ~ aNaturalNumber0(xm)
| xm = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_392,c_2110]) ).
cnf(c_2766,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2763,c_776,c_73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM457+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu May 2 19:44:31 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.62/1.22 % SZS status Started for theBenchmark.p
% 3.62/1.22 % SZS status Theorem for theBenchmark.p
% 3.62/1.22
% 3.62/1.22 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.62/1.22
% 3.62/1.22 ------ iProver source info
% 3.62/1.22
% 3.62/1.22 git: date: 2024-05-02 19:28:25 +0000
% 3.62/1.22 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.62/1.22 git: non_committed_changes: false
% 3.62/1.22
% 3.62/1.22 ------ Parsing...
% 3.62/1.22 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.62/1.22
% 3.62/1.22 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.62/1.22
% 3.62/1.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.62/1.22
% 3.62/1.22 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.62/1.22 ------ Proving...
% 3.62/1.22 ------ Problem Properties
% 3.62/1.22
% 3.62/1.22
% 3.62/1.22 clauses 29
% 3.62/1.22 conjectures 3
% 3.62/1.22 EPR 8
% 3.62/1.22 Horn 27
% 3.62/1.22 unary 9
% 3.62/1.22 binary 6
% 3.62/1.22 lits 79
% 3.62/1.22 lits eq 31
% 3.62/1.22 fd_pure 0
% 3.62/1.22 fd_pseudo 0
% 3.62/1.22 fd_cond 2
% 3.62/1.22 fd_pseudo_cond 4
% 3.62/1.22 AC symbols 0
% 3.62/1.22
% 3.62/1.22 ------ Schedule dynamic 5 is on
% 3.62/1.22
% 3.62/1.22 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.62/1.22
% 3.62/1.22
% 3.62/1.22 ------
% 3.62/1.22 Current options:
% 3.62/1.22 ------
% 3.62/1.22
% 3.62/1.22
% 3.62/1.22
% 3.62/1.22
% 3.62/1.22 ------ Proving...
% 3.62/1.22
% 3.62/1.22
% 3.62/1.22 % SZS status Theorem for theBenchmark.p
% 3.62/1.22
% 3.62/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.62/1.22
% 3.62/1.22
%------------------------------------------------------------------------------