TSTP Solution File: NUM613+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM613+1 : 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 : Thu Aug 31 11:31:52 EDT 2023
% Result : Theorem 5.90s 1.67s
% Output : CNFRefutation 5.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 18 unt; 0 def)
% Number of atoms : 56 ( 37 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 52 ( 25 ~; 21 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 14 ( 0 sgn; 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [X0,X1] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X0,szNzAzT0) )
=> ( szszuzczcdt0(X0) = szszuzczcdt0(X1)
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSuccEquSucc) ).
fof(f80,axiom,
( xK = szszuzczcdt0(xk)
& aElementOf0(xk,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3533) ).
fof(f109,axiom,
( aElementOf0(sbrdtbr0(xP),szNzAzT0)
& sbrdtbr0(xQ) = szszuzczcdt0(sbrdtbr0(xP))
& szszuzczcdt0(xk) = sbrdtbr0(xQ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5255) ).
fof(f110,conjecture,
xk = sbrdtbr0(xP),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f111,negated_conjecture,
xk != sbrdtbr0(xP),
inference(negated_conjecture,[],[f110]) ).
fof(f119,plain,
xk != sbrdtbr0(xP),
inference(flattening,[],[f111]) ).
fof(f150,plain,
! [X0,X1] :
( X0 = X1
| szszuzczcdt0(X0) != szszuzczcdt0(X1)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f151,plain,
! [X0,X1] :
( X0 = X1
| szszuzczcdt0(X0) != szszuzczcdt0(X1)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(flattening,[],[f150]) ).
fof(f384,plain,
! [X0,X1] :
( X0 = X1
| szszuzczcdt0(X0) != szszuzczcdt0(X1)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f151]) ).
fof(f491,plain,
aElementOf0(xk,szNzAzT0),
inference(cnf_transformation,[],[f80]) ).
fof(f492,plain,
xK = szszuzczcdt0(xk),
inference(cnf_transformation,[],[f80]) ).
fof(f545,plain,
szszuzczcdt0(xk) = sbrdtbr0(xQ),
inference(cnf_transformation,[],[f109]) ).
fof(f546,plain,
sbrdtbr0(xQ) = szszuzczcdt0(sbrdtbr0(xP)),
inference(cnf_transformation,[],[f109]) ).
fof(f547,plain,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(cnf_transformation,[],[f109]) ).
fof(f548,plain,
xk != sbrdtbr0(xP),
inference(cnf_transformation,[],[f119]) ).
cnf(c_99,plain,
( szszuzczcdt0(X0) != szszuzczcdt0(X1)
| ~ aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| X0 = X1 ),
inference(cnf_transformation,[],[f384]) ).
cnf(c_206,plain,
szszuzczcdt0(xk) = xK,
inference(cnf_transformation,[],[f492]) ).
cnf(c_207,plain,
aElementOf0(xk,szNzAzT0),
inference(cnf_transformation,[],[f491]) ).
cnf(c_260,plain,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(cnf_transformation,[],[f547]) ).
cnf(c_261,plain,
szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
inference(cnf_transformation,[],[f546]) ).
cnf(c_262,plain,
szszuzczcdt0(xk) = sbrdtbr0(xQ),
inference(cnf_transformation,[],[f545]) ).
cnf(c_263,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(cnf_transformation,[],[f548]) ).
cnf(c_1768,plain,
sbrdtbr0(xQ) = xK,
inference(light_normalisation,[status(thm)],[c_262,c_206]) ).
cnf(c_1780,plain,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(light_normalisation,[status(thm)],[c_261,c_1768]) ).
cnf(c_15270,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_19529,plain,
( szszuzczcdt0(sbrdtbr0(xP)) != szszuzczcdt0(xk)
| ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| ~ aElementOf0(xk,szNzAzT0)
| sbrdtbr0(xP) = xk ),
inference(instantiation,[status(thm)],[c_99]) ).
cnf(c_24554,plain,
( szszuzczcdt0(sbrdtbr0(xP)) != X0
| szszuzczcdt0(xk) != X0
| szszuzczcdt0(sbrdtbr0(xP)) = szszuzczcdt0(xk) ),
inference(instantiation,[status(thm)],[c_15270]) ).
cnf(c_41093,plain,
( szszuzczcdt0(sbrdtbr0(xP)) != xK
| szszuzczcdt0(xk) != xK
| szszuzczcdt0(sbrdtbr0(xP)) = szszuzczcdt0(xk) ),
inference(instantiation,[status(thm)],[c_24554]) ).
cnf(c_41094,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_41093,c_19529,c_1780,c_263,c_206,c_260,c_207]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM613+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.16/0.35 % Computer : n016.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Fri Aug 25 14:07:10 EDT 2023
% 0.16/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.90/1.67 % SZS status Started for theBenchmark.p
% 5.90/1.67 % SZS status Theorem for theBenchmark.p
% 5.90/1.67
% 5.90/1.67 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 5.90/1.67
% 5.90/1.67 ------ iProver source info
% 5.90/1.67
% 5.90/1.67 git: date: 2023-05-31 18:12:56 +0000
% 5.90/1.67 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 5.90/1.67 git: non_committed_changes: false
% 5.90/1.67 git: last_make_outside_of_git: false
% 5.90/1.67
% 5.90/1.67 ------ Parsing...
% 5.90/1.67 ------ Clausification by vclausify_rel & Parsing by iProver...
% 5.90/1.67
% 5.90/1.67 ------ Preprocessing... sup_sim: 5 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 5.90/1.67
% 5.90/1.67 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 5.90/1.67
% 5.90/1.67 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 5.90/1.67 ------ Proving...
% 5.90/1.67 ------ Problem Properties
% 5.90/1.67
% 5.90/1.67
% 5.90/1.67 clauses 210
% 5.90/1.67 conjectures 1
% 5.90/1.67 EPR 52
% 5.90/1.67 Horn 171
% 5.90/1.67 unary 52
% 5.90/1.67 binary 32
% 5.90/1.67 lits 665
% 5.90/1.67 lits eq 109
% 5.90/1.67 fd_pure 0
% 5.90/1.67 fd_pseudo 0
% 5.90/1.67 fd_cond 10
% 5.90/1.67 fd_pseudo_cond 25
% 5.90/1.67 AC symbols 0
% 5.90/1.67
% 5.90/1.67 ------ Schedule dynamic 5 is on
% 5.90/1.67
% 5.90/1.67 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 5.90/1.67
% 5.90/1.67
% 5.90/1.67 ------
% 5.90/1.67 Current options:
% 5.90/1.67 ------
% 5.90/1.67
% 5.90/1.67
% 5.90/1.67
% 5.90/1.67
% 5.90/1.67 ------ Proving...
% 5.90/1.67
% 5.90/1.67
% 5.90/1.67 % SZS status Theorem for theBenchmark.p
% 5.90/1.67
% 5.90/1.67 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 5.90/1.67
% 5.90/1.67
%------------------------------------------------------------------------------