TSTP Solution File: SEU230+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU230+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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 17:04:58 EDT 2023
% Result : Theorem 1.86s 1.22s
% Output : CNFRefutation 1.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 13 unt; 0 def)
% Number of atoms : 140 ( 39 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 179 ( 69 ~; 68 |; 35 &)
% ( 4 <=>; 3 =>; 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 : 6 ( 6 usr; 1 con; 0-3 aty)
% Number of variables : 67 ( 1 sgn; 54 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
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(f32,conjecture,
! [X0] : in(X0,succ(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(f33,negated_conjecture,
~ ! [X0] : in(X0,succ(X0)),
inference(negated_conjecture,[],[f32]) ).
fof(f55,plain,
? [X0] : ~ in(X0,succ(X0)),
inference(ennf_transformation,[],[f33]) ).
fof(f62,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(f63,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,[],[f62]) ).
fof(f64,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(f65,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])],[f63,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) ) ) )
& ( ! [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(f67,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,[],[f66]) ).
fof(f68,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,[],[f67]) ).
fof(f69,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(f70,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])],[f68,f69]) ).
fof(f91,plain,
( ? [X0] : ~ in(X0,succ(X0))
=> ~ in(sK12,succ(sK12)) ),
introduced(choice_axiom,[]) ).
fof(f92,plain,
~ in(sK12,succ(sK12)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f55,f91]) ).
fof(f99,plain,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
inference(cnf_transformation,[],[f6]) ).
fof(f101,plain,
! [X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f65]) ).
fof(f106,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f70]) ).
fof(f137,plain,
~ in(sK12,succ(sK12)),
inference(cnf_transformation,[],[f92]) ).
fof(f145,plain,
~ in(sK12,set_union2(sK12,singleton(sK12))),
inference(definition_unfolding,[],[f137,f99]) ).
fof(f146,plain,
! [X3,X1] :
( in(X3,X1)
| singleton(X3) != X1 ),
inference(equality_resolution,[],[f101]) ).
fof(f147,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f146]) ).
fof(f149,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f106]) ).
cnf(c_55,plain,
in(X0,singleton(X0)),
inference(cnf_transformation,[],[f147]) ).
cnf(c_60,plain,
( ~ in(X0,X1)
| in(X0,set_union2(X2,X1)) ),
inference(cnf_transformation,[],[f149]) ).
cnf(c_90,negated_conjecture,
~ in(sK12,set_union2(sK12,singleton(sK12))),
inference(cnf_transformation,[],[f145]) ).
cnf(c_935,plain,
~ in(sK12,singleton(sK12)),
inference(superposition,[status(thm)],[c_60,c_90]) ).
cnf(c_937,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_935,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU230+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Aug 23 12:26:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.86/1.22 % SZS status Started for theBenchmark.p
% 1.86/1.22 % SZS status Theorem for theBenchmark.p
% 1.86/1.22
% 1.86/1.22 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.86/1.22
% 1.86/1.22 ------ iProver source info
% 1.86/1.22
% 1.86/1.22 git: date: 2023-05-31 18:12:56 +0000
% 1.86/1.22 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.86/1.22 git: non_committed_changes: false
% 1.86/1.22 git: last_make_outside_of_git: false
% 1.86/1.22
% 1.86/1.22 ------ Parsing...
% 1.86/1.22 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.86/1.22
% 1.86/1.22 ------ Preprocessing... sup_sim: 0 sf_s rm: 18 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 1.86/1.22
% 1.86/1.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.86/1.22
% 1.86/1.22 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.86/1.22 ------ Proving...
% 1.86/1.22 ------ Problem Properties
% 1.86/1.22
% 1.86/1.22
% 1.86/1.22 clauses 28
% 1.86/1.22 conjectures 1
% 1.86/1.22 EPR 10
% 1.86/1.22 Horn 24
% 1.86/1.22 unary 12
% 1.86/1.22 binary 9
% 1.86/1.22 lits 52
% 1.86/1.22 lits eq 13
% 1.86/1.22 fd_pure 0
% 1.86/1.22 fd_pseudo 0
% 1.86/1.22 fd_cond 1
% 1.86/1.22 fd_pseudo_cond 6
% 1.86/1.22 AC symbols 0
% 1.86/1.22
% 1.86/1.22 ------ Schedule dynamic 5 is on
% 1.86/1.22
% 1.86/1.22 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.86/1.22
% 1.86/1.22
% 1.86/1.22 ------
% 1.86/1.22 Current options:
% 1.86/1.22 ------
% 1.86/1.22
% 1.86/1.22
% 1.86/1.22
% 1.86/1.22
% 1.86/1.22 ------ Proving...
% 1.86/1.22
% 1.86/1.22
% 1.86/1.22 % SZS status Theorem for theBenchmark.p
% 1.86/1.22
% 1.86/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.86/1.22
% 1.86/1.22
%------------------------------------------------------------------------------