TSTP Solution File: NUM568+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM568+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:31 EDT 2023
% Result : Theorem 3.65s 1.16s
% Output : CNFRefutation 3.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 55 ( 28 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 49 ( 19 ~; 20 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 18 ( 0 sgn; 9 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f27,axiom,
! [X0] :
( aElementOf0(X0,szNzAzT0)
=> ( ? [X1] :
( szszuzczcdt0(X1) = X0
& aElementOf0(X1,szNzAzT0) )
| sz00 = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNatExtra) ).
fof(f74,axiom,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3418) ).
fof(f79,axiom,
sz00 != xK,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3520) ).
fof(f80,conjecture,
? [X0] :
( szszuzczcdt0(X0) = xK
& aElementOf0(X0,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f81,negated_conjecture,
~ ? [X0] :
( szszuzczcdt0(X0) = xK
& aElementOf0(X0,szNzAzT0) ),
inference(negated_conjecture,[],[f80]) ).
fof(f123,plain,
! [X0] :
( ? [X1] :
( szszuzczcdt0(X1) = X0
& aElementOf0(X1,szNzAzT0) )
| sz00 = X0
| ~ aElementOf0(X0,szNzAzT0) ),
inference(ennf_transformation,[],[f27]) ).
fof(f124,plain,
! [X0] :
( ? [X1] :
( szszuzczcdt0(X1) = X0
& aElementOf0(X1,szNzAzT0) )
| sz00 = X0
| ~ aElementOf0(X0,szNzAzT0) ),
inference(flattening,[],[f123]) ).
fof(f195,plain,
! [X0] :
( szszuzczcdt0(X0) != xK
| ~ aElementOf0(X0,szNzAzT0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f229,plain,
! [X0] :
( ? [X1] :
( szszuzczcdt0(X1) = X0
& aElementOf0(X1,szNzAzT0) )
=> ( szszuzczcdt0(sK12(X0)) = X0
& aElementOf0(sK12(X0),szNzAzT0) ) ),
introduced(choice_axiom,[]) ).
fof(f230,plain,
! [X0] :
( ( szszuzczcdt0(sK12(X0)) = X0
& aElementOf0(sK12(X0),szNzAzT0) )
| sz00 = X0
| ~ aElementOf0(X0,szNzAzT0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f124,f229]) ).
fof(f359,plain,
! [X0] :
( aElementOf0(sK12(X0),szNzAzT0)
| sz00 = X0
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f230]) ).
fof(f360,plain,
! [X0] :
( szszuzczcdt0(sK12(X0)) = X0
| sz00 = X0
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f230]) ).
fof(f453,plain,
aElementOf0(xK,szNzAzT0),
inference(cnf_transformation,[],[f74]) ).
fof(f505,plain,
sz00 != xK,
inference(cnf_transformation,[],[f79]) ).
fof(f506,plain,
! [X0] :
( szszuzczcdt0(X0) != xK
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f195]) ).
cnf(c_100,plain,
( ~ aElementOf0(X0,szNzAzT0)
| szszuzczcdt0(sK12(X0)) = X0
| X0 = sz00 ),
inference(cnf_transformation,[],[f360]) ).
cnf(c_101,plain,
( ~ aElementOf0(X0,szNzAzT0)
| X0 = sz00
| aElementOf0(sK12(X0),szNzAzT0) ),
inference(cnf_transformation,[],[f359]) ).
cnf(c_194,plain,
aElementOf0(xK,szNzAzT0),
inference(cnf_transformation,[],[f453]) ).
cnf(c_246,plain,
sz00 != xK,
inference(cnf_transformation,[],[f505]) ).
cnf(c_247,negated_conjecture,
( szszuzczcdt0(X0) != xK
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f506]) ).
cnf(c_19658,plain,
( szszuzczcdt0(sK12(xK)) = xK
| sz00 = xK ),
inference(superposition,[status(thm)],[c_194,c_100]) ).
cnf(c_19662,plain,
szszuzczcdt0(sK12(xK)) = xK,
inference(forward_subsumption_resolution,[status(thm)],[c_19658,c_246]) ).
cnf(c_19768,plain,
~ aElementOf0(sK12(xK),szNzAzT0),
inference(superposition,[status(thm)],[c_19662,c_247]) ).
cnf(c_19770,plain,
( ~ aElementOf0(xK,szNzAzT0)
| sz00 = xK ),
inference(superposition,[status(thm)],[c_101,c_19768]) ).
cnf(c_19771,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_19770,c_246,c_194]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM568+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.17/0.35 % Computer : n031.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Fri Aug 25 15:51:52 EDT 2023
% 0.17/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.65/1.16 % SZS status Started for theBenchmark.p
% 3.65/1.16 % SZS status Theorem for theBenchmark.p
% 3.65/1.16
% 3.65/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.65/1.16
% 3.65/1.16 ------ iProver source info
% 3.65/1.16
% 3.65/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.65/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.65/1.16 git: non_committed_changes: false
% 3.65/1.16 git: last_make_outside_of_git: false
% 3.65/1.16
% 3.65/1.16 ------ Parsing...
% 3.65/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.65/1.16
% 3.65/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 3.65/1.16
% 3.65/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.65/1.16
% 3.65/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.65/1.16 ------ Proving...
% 3.65/1.16 ------ Problem Properties
% 3.65/1.16
% 3.65/1.16
% 3.65/1.16 clauses 164
% 3.65/1.16 conjectures 1
% 3.65/1.16 EPR 38
% 3.65/1.16 Horn 124
% 3.65/1.16 unary 20
% 3.65/1.16 binary 26
% 3.65/1.16 lits 568
% 3.65/1.16 lits eq 84
% 3.65/1.16 fd_pure 0
% 3.65/1.16 fd_pseudo 0
% 3.65/1.16 fd_cond 10
% 3.65/1.16 fd_pseudo_cond 24
% 3.65/1.16 AC symbols 0
% 3.65/1.16
% 3.65/1.16 ------ Schedule dynamic 5 is on
% 3.65/1.16
% 3.65/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.65/1.16
% 3.65/1.16
% 3.65/1.16 ------
% 3.65/1.16 Current options:
% 3.65/1.16 ------
% 3.65/1.16
% 3.65/1.16
% 3.65/1.16
% 3.65/1.16
% 3.65/1.16 ------ Proving...
% 3.65/1.16
% 3.65/1.16
% 3.65/1.16 % SZS status Theorem for theBenchmark.p
% 3.65/1.16
% 3.65/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.65/1.16
% 3.65/1.16
%------------------------------------------------------------------------------