TSTP Solution File: SEU124+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU124+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:03:51 EDT 2023
% Result : Theorem 0.48s 1.17s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 7 unt; 0 def)
% Number of atoms : 132 ( 10 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 163 ( 62 ~; 61 |; 32 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 74 ( 2 sgn; 55 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1,X2] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f30,conjecture,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(f31,negated_conjecture,
~ ! [X0,X1] : subset(X0,set_union2(X0,X1)),
inference(negated_conjecture,[],[f30]) ).
fof(f39,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f50,plain,
? [X0,X1] : ~ subset(X0,set_union2(X0,X1)),
inference(ennf_transformation,[],[f31]) ).
fof(f58,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,[],[f6]) ).
fof(f59,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,[],[f58]) ).
fof(f60,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,[],[f59]) ).
fof(f61,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(f62,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])],[f60,f61]) ).
fof(f63,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f64,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f63]) ).
fof(f65,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f66,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f64,f65]) ).
fof(f81,plain,
( ? [X0,X1] : ~ subset(X0,set_union2(X0,X1))
=> ~ subset(sK8,set_union2(sK8,sK9)) ),
introduced(choice_axiom,[]) ).
fof(f82,plain,
~ subset(sK8,set_union2(sK8,sK9)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9])],[f50,f81]) ).
fof(f92,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f62]) ).
fof(f98,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f66]) ).
fof(f99,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f66]) ).
fof(f128,plain,
~ subset(sK8,set_union2(sK8,sK9)),
inference(cnf_transformation,[],[f82]) ).
fof(f134,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f92]) ).
cnf(c_61,plain,
( ~ in(X0,X1)
| in(X0,set_union2(X1,X2)) ),
inference(cnf_transformation,[],[f134]) ).
cnf(c_63,plain,
( ~ in(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f99]) ).
cnf(c_64,plain,
( in(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f98]) ).
cnf(c_94,negated_conjecture,
~ subset(sK8,set_union2(sK8,sK9)),
inference(cnf_transformation,[],[f128]) ).
cnf(c_2173,plain,
( ~ in(sK2(sK8,set_union2(sK8,sK9)),set_union2(sK8,sK9))
| subset(sK8,set_union2(sK8,sK9)) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_2174,plain,
( in(sK2(sK8,set_union2(sK8,sK9)),sK8)
| subset(sK8,set_union2(sK8,sK9)) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_2344,plain,
( ~ in(sK2(sK8,set_union2(sK8,sK9)),sK8)
| in(sK2(sK8,set_union2(sK8,sK9)),set_union2(sK8,X0)) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_2962,plain,
( ~ in(sK2(sK8,set_union2(sK8,sK9)),sK8)
| in(sK2(sK8,set_union2(sK8,sK9)),set_union2(sK8,sK9)) ),
inference(instantiation,[status(thm)],[c_2344]) ).
cnf(c_2963,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2962,c_2174,c_2173,c_94]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU124+2 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 24 00:13:27 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.48/1.17 % SZS status Started for theBenchmark.p
% 0.48/1.17 % SZS status Theorem for theBenchmark.p
% 0.48/1.17
% 0.48/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.17
% 0.48/1.17 ------ iProver source info
% 0.48/1.17
% 0.48/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.17 git: non_committed_changes: false
% 0.48/1.17 git: last_make_outside_of_git: false
% 0.48/1.17
% 0.48/1.17 ------ Parsing...
% 0.48/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.48/1.17 ------ Proving...
% 0.48/1.17 ------ Problem Properties
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 clauses 45
% 0.48/1.17 conjectures 1
% 0.48/1.17 EPR 16
% 0.48/1.17 Horn 36
% 0.48/1.17 unary 12
% 0.48/1.17 binary 20
% 0.48/1.17 lits 93
% 0.48/1.17 lits eq 18
% 0.48/1.17 fd_pure 0
% 0.48/1.17 fd_pseudo 0
% 0.48/1.17 fd_cond 3
% 0.48/1.17 fd_pseudo_cond 8
% 0.48/1.17 AC symbols 0
% 0.48/1.17
% 0.48/1.17 ------ Schedule dynamic 5 is on
% 0.48/1.17
% 0.48/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------
% 0.48/1.17 Current options:
% 0.48/1.17 ------
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------ Proving...
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 % SZS status Theorem for theBenchmark.p
% 0.48/1.17
% 0.48/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.17
% 0.48/1.17
%------------------------------------------------------------------------------