TSTP Solution File: NUM568+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM568+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:58 EDT 2024
% Result : Theorem 7.75s 1.66s
% Output : CNFRefutation 7.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 57 ( 29 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 52 ( 21 ~; 21 |; 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 : 19 ( 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(f121,plain,
! [X0] :
( ? [X1] :
( szszuzczcdt0(X1) = X0
& aElementOf0(X1,szNzAzT0) )
| sz00 = X0
| ~ aElementOf0(X0,szNzAzT0) ),
inference(ennf_transformation,[],[f27]) ).
fof(f122,plain,
! [X0] :
( ? [X1] :
( szszuzczcdt0(X1) = X0
& aElementOf0(X1,szNzAzT0) )
| sz00 = X0
| ~ aElementOf0(X0,szNzAzT0) ),
inference(flattening,[],[f121]) ).
fof(f190,plain,
! [X0] :
( szszuzczcdt0(X0) != xK
| ~ aElementOf0(X0,szNzAzT0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f219,plain,
! [X0] :
( ? [X1] :
( szszuzczcdt0(X1) = X0
& aElementOf0(X1,szNzAzT0) )
=> ( szszuzczcdt0(sK8(X0)) = X0
& aElementOf0(sK8(X0),szNzAzT0) ) ),
introduced(choice_axiom,[]) ).
fof(f220,plain,
! [X0] :
( ( szszuzczcdt0(sK8(X0)) = X0
& aElementOf0(sK8(X0),szNzAzT0) )
| sz00 = X0
| ~ aElementOf0(X0,szNzAzT0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f122,f219]) ).
fof(f326,plain,
! [X0] :
( aElementOf0(sK8(X0),szNzAzT0)
| sz00 = X0
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f220]) ).
fof(f327,plain,
! [X0] :
( szszuzczcdt0(sK8(X0)) = X0
| sz00 = X0
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f220]) ).
fof(f420,plain,
aElementOf0(xK,szNzAzT0),
inference(cnf_transformation,[],[f74]) ).
fof(f431,plain,
sz00 != xK,
inference(cnf_transformation,[],[f79]) ).
fof(f432,plain,
! [X0] :
( szszuzczcdt0(X0) != xK
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f190]) ).
cnf(c_100,plain,
( ~ aElementOf0(X0,szNzAzT0)
| szszuzczcdt0(sK8(X0)) = X0
| X0 = sz00 ),
inference(cnf_transformation,[],[f327]) ).
cnf(c_101,plain,
( ~ aElementOf0(X0,szNzAzT0)
| X0 = sz00
| aElementOf0(sK8(X0),szNzAzT0) ),
inference(cnf_transformation,[],[f326]) ).
cnf(c_194,plain,
aElementOf0(xK,szNzAzT0),
inference(cnf_transformation,[],[f420]) ).
cnf(c_205,plain,
sz00 != xK,
inference(cnf_transformation,[],[f431]) ).
cnf(c_206,negated_conjecture,
( szszuzczcdt0(X0) != xK
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f432]) ).
cnf(c_14273,negated_conjecture,
( szszuzczcdt0(X0) != xK
| ~ aElementOf0(X0,szNzAzT0) ),
inference(demodulation,[status(thm)],[c_206]) ).
cnf(c_18421,plain,
( szszuzczcdt0(sK8(xK)) = xK
| sz00 = xK ),
inference(superposition,[status(thm)],[c_194,c_100]) ).
cnf(c_18422,plain,
szszuzczcdt0(sK8(xK)) = xK,
inference(forward_subsumption_resolution,[status(thm)],[c_18421,c_205]) ).
cnf(c_18574,plain,
~ aElementOf0(sK8(xK),szNzAzT0),
inference(superposition,[status(thm)],[c_18422,c_14273]) ).
cnf(c_18580,plain,
( ~ aElementOf0(xK,szNzAzT0)
| sz00 = xK ),
inference(superposition,[status(thm)],[c_101,c_18574]) ).
cnf(c_18581,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_18580,c_205,c_194]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM568+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n013.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 19:27:04 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.75/1.66 % SZS status Started for theBenchmark.p
% 7.75/1.66 % SZS status Theorem for theBenchmark.p
% 7.75/1.66
% 7.75/1.66 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.75/1.66
% 7.75/1.66 ------ iProver source info
% 7.75/1.66
% 7.75/1.66 git: date: 2024-05-02 19:28:25 +0000
% 7.75/1.66 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.75/1.66 git: non_committed_changes: false
% 7.75/1.66
% 7.75/1.66 ------ Parsing...
% 7.75/1.66 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.75/1.66
% 7.75/1.66 ------ Preprocessing... sup_sim: 0 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
% 7.75/1.66
% 7.75/1.66 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.75/1.66
% 7.75/1.66 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.75/1.66 ------ Proving...
% 7.75/1.66 ------ Problem Properties
% 7.75/1.66
% 7.75/1.66
% 7.75/1.66 clauses 150
% 7.75/1.66 conjectures 1
% 7.75/1.66 EPR 36
% 7.75/1.66 Horn 111
% 7.75/1.66 unary 18
% 7.75/1.66 binary 18
% 7.75/1.66 lits 536
% 7.75/1.66 lits eq 79
% 7.75/1.66 fd_pure 0
% 7.75/1.66 fd_pseudo 0
% 7.75/1.66 fd_cond 10
% 7.75/1.66 fd_pseudo_cond 24
% 7.75/1.66 AC symbols 0
% 7.75/1.66
% 7.75/1.66 ------ Schedule dynamic 5 is on
% 7.75/1.66
% 7.75/1.66 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.75/1.66
% 7.75/1.66
% 7.75/1.66 ------
% 7.75/1.66 Current options:
% 7.75/1.66 ------
% 7.75/1.66
% 7.75/1.66
% 7.75/1.66
% 7.75/1.66
% 7.75/1.66 ------ Proving...
% 7.75/1.66
% 7.75/1.66
% 7.75/1.66 % SZS status Theorem for theBenchmark.p
% 7.75/1.66
% 7.75/1.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.75/1.66
% 7.75/1.66
%------------------------------------------------------------------------------