TSTP Solution File: NUM385+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM385+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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:14 EDT 2023
% Result : Theorem 2.50s 1.15s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 46 ( 15 unt; 0 def)
% Number of atoms : 176 ( 59 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 208 ( 78 ~; 81 |; 39 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 84 ( 0 sgn; 64 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( in(X0,X1)
=> ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f6,axiom,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(f7,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f8,axiom,
! [X0,X1,X2] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f28,axiom,
! [X0] : in(X0,succ(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(f29,conjecture,
! [X0,X1] :
( succ(X0) = succ(X1)
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_ordinal1) ).
fof(f30,negated_conjecture,
~ ! [X0,X1] :
( succ(X0) = succ(X1)
=> X0 = X1 ),
inference(negated_conjecture,[],[f29]) ).
fof(f44,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f53,plain,
? [X0,X1] :
( X0 != X1
& succ(X0) = succ(X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f60,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f61,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f60]) ).
fof(f62,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f63,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f61,f62]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X0)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f65,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X0)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(flattening,[],[f64]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X1)
& ~ in(X4,X0) ) )
& ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(rectify,[],[f65]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) )
=> ( ( ( ~ in(sK1(X0,X1,X2),X1)
& ~ in(sK1(X0,X1,X2),X0) )
| ~ in(sK1(X0,X1,X2),X2) )
& ( in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X0)
| in(sK1(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ( ( ( ~ in(sK1(X0,X1,X2),X1)
& ~ in(sK1(X0,X1,X2),X0) )
| ~ in(sK1(X0,X1,X2),X2) )
& ( in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X0)
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X1)
& ~ in(X4,X0) ) )
& ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f66,f67]) ).
fof(f91,plain,
( ? [X0,X1] :
( X0 != X1
& succ(X0) = succ(X1) )
=> ( sK13 != sK14
& succ(sK13) = succ(sK14) ) ),
introduced(choice_axiom,[]) ).
fof(f92,plain,
( sK13 != sK14
& succ(sK13) = succ(sK14) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f53,f91]) ).
fof(f93,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
fof(f99,plain,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
inference(cnf_transformation,[],[f6]) ).
fof(f100,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f63]) ).
fof(f104,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f68]) ).
fof(f139,plain,
! [X0] : in(X0,succ(X0)),
inference(cnf_transformation,[],[f28]) ).
fof(f140,plain,
succ(sK13) = succ(sK14),
inference(cnf_transformation,[],[f92]) ).
fof(f141,plain,
sK13 != sK14,
inference(cnf_transformation,[],[f92]) ).
fof(f149,plain,
! [X0] : in(X0,set_union2(X0,singleton(X0))),
inference(definition_unfolding,[],[f139,f99]) ).
fof(f150,plain,
set_union2(sK13,singleton(sK13)) = set_union2(sK14,singleton(sK14)),
inference(definition_unfolding,[],[f140,f99,f99]) ).
fof(f153,plain,
! [X3,X0] :
( X0 = X3
| ~ in(X3,singleton(X0)) ),
inference(equality_resolution,[],[f100]) ).
fof(f156,plain,
! [X0,X1,X4] :
( in(X4,X1)
| in(X4,X0)
| ~ in(X4,set_union2(X0,X1)) ),
inference(equality_resolution,[],[f104]) ).
cnf(c_49,plain,
( ~ in(X0,X1)
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f93]) ).
cnf(c_56,plain,
( ~ in(X0,singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f153]) ).
cnf(c_62,plain,
( ~ in(X0,set_union2(X1,X2))
| in(X0,X1)
| in(X0,X2) ),
inference(cnf_transformation,[],[f156]) ).
cnf(c_92,plain,
in(X0,set_union2(X0,singleton(X0))),
inference(cnf_transformation,[],[f149]) ).
cnf(c_93,negated_conjecture,
sK13 != sK14,
inference(cnf_transformation,[],[f141]) ).
cnf(c_94,negated_conjecture,
set_union2(sK13,singleton(sK13)) = set_union2(sK14,singleton(sK14)),
inference(cnf_transformation,[],[f150]) ).
cnf(c_881,plain,
in(sK14,set_union2(sK13,singleton(sK13))),
inference(superposition,[status(thm)],[c_94,c_92]) ).
cnf(c_1107,plain,
( in(sK14,singleton(sK13))
| in(sK14,sK13) ),
inference(superposition,[status(thm)],[c_881,c_62]) ).
cnf(c_1113,plain,
( ~ in(X0,set_union2(sK13,singleton(sK13)))
| in(X0,singleton(sK14))
| in(X0,sK14) ),
inference(superposition,[status(thm)],[c_94,c_62]) ).
cnf(c_1139,plain,
( ~ in(sK13,singleton(sK14))
| sK13 = sK14 ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_1262,plain,
( in(sK13,singleton(sK14))
| in(sK13,sK14) ),
inference(superposition,[status(thm)],[c_92,c_1113]) ).
cnf(c_1297,plain,
( sK13 = sK14
| in(sK14,sK13) ),
inference(superposition,[status(thm)],[c_1107,c_56]) ).
cnf(c_1298,plain,
in(sK14,sK13),
inference(forward_subsumption_resolution,[status(thm)],[c_1297,c_93]) ).
cnf(c_1299,plain,
~ in(sK13,sK14),
inference(superposition,[status(thm)],[c_1298,c_49]) ).
cnf(c_1301,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1299,c_1262,c_1139,c_93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM385+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 25 07:44:26 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.50/1.15 % SZS status Started for theBenchmark.p
% 2.50/1.15 % SZS status Theorem for theBenchmark.p
% 2.50/1.15
% 2.50/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.50/1.15
% 2.50/1.15 ------ iProver source info
% 2.50/1.15
% 2.50/1.15 git: date: 2023-05-31 18:12:56 +0000
% 2.50/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.50/1.15 git: non_committed_changes: false
% 2.50/1.15 git: last_make_outside_of_git: false
% 2.50/1.15
% 2.50/1.15 ------ Parsing...
% 2.50/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.50/1.15
% 2.50/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 20 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 2.50/1.15
% 2.50/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.50/1.15
% 2.50/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.50/1.15 ------ Proving...
% 2.50/1.15 ------ Problem Properties
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15 clauses 30
% 2.50/1.15 conjectures 2
% 2.50/1.15 EPR 11
% 2.50/1.15 Horn 26
% 2.50/1.15 unary 14
% 2.50/1.15 binary 9
% 2.50/1.15 lits 54
% 2.50/1.15 lits eq 15
% 2.50/1.15 fd_pure 0
% 2.50/1.15 fd_pseudo 0
% 2.50/1.15 fd_cond 1
% 2.50/1.15 fd_pseudo_cond 6
% 2.50/1.15 AC symbols 0
% 2.50/1.15
% 2.50/1.15 ------ Schedule dynamic 5 is on
% 2.50/1.15
% 2.50/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15 ------
% 2.50/1.15 Current options:
% 2.50/1.15 ------
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15 ------ Proving...
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15 % SZS status Theorem for theBenchmark.p
% 2.50/1.15
% 2.50/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.50/1.15
% 2.50/1.15
%------------------------------------------------------------------------------