TSTP Solution File: SEU128+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU128+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:53 EDT 2023
% Result : Theorem 3.81s 1.17s
% Output : CNFRefutation 3.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 42 ( 7 unt; 0 def)
% Number of atoms : 174 ( 10 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 212 ( 80 ~; 77 |; 45 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 90 ( 0 sgn; 60 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
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(f8,axiom,
! [X0,X1,X2] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f24,conjecture,
! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(f25,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,set_intersection2(X1,X2)) ),
inference(negated_conjecture,[],[f24]) ).
fof(f44,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f49,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f50,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X2)
& subset(X0,X1) ),
inference(flattening,[],[f49]) ).
fof(f72,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,[],[f44]) ).
fof(f73,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,[],[f72]) ).
fof(f74,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f75,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])],[f73,f74]) ).
fof(f76,plain,
! [X0,X1,X2] :
( ( set_intersection2(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_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f77,plain,
! [X0,X1,X2] :
( ( set_intersection2(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_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f76]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ( set_intersection2(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_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f77]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) )
=> ( ( ~ in(sK3(X0,X1,X2),X1)
| ~ in(sK3(X0,X1,X2),X0)
| ~ in(sK3(X0,X1,X2),X2) )
& ( ( in(sK3(X0,X1,X2),X1)
& in(sK3(X0,X1,X2),X0) )
| in(sK3(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f80,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ( ( ~ in(sK3(X0,X1,X2),X1)
| ~ in(sK3(X0,X1,X2),X0)
| ~ in(sK3(X0,X1,X2),X2) )
& ( ( in(sK3(X0,X1,X2),X1)
& in(sK3(X0,X1,X2),X0) )
| in(sK3(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f78,f79]) ).
fof(f86,plain,
( ? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X2)
& subset(X0,X1) )
=> ( ~ subset(sK6,set_intersection2(sK7,sK8))
& subset(sK6,sK8)
& subset(sK6,sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f87,plain,
( ~ subset(sK6,set_intersection2(sK7,sK8))
& subset(sK6,sK8)
& subset(sK6,sK7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f50,f86]) ).
fof(f106,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f75]) ).
fof(f107,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f108,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f75]) ).
fof(f111,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f80]) ).
fof(f128,plain,
subset(sK6,sK7),
inference(cnf_transformation,[],[f87]) ).
fof(f129,plain,
subset(sK6,sK8),
inference(cnf_transformation,[],[f87]) ).
fof(f130,plain,
~ subset(sK6,set_intersection2(sK7,sK8)),
inference(cnf_transformation,[],[f87]) ).
fof(f152,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X1)
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f111]) ).
cnf(c_63,plain,
( ~ in(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f108]) ).
cnf(c_64,plain,
( in(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f107]) ).
cnf(c_65,plain,
( ~ in(X0,X1)
| ~ subset(X1,X2)
| in(X0,X2) ),
inference(cnf_transformation,[],[f106]) ).
cnf(c_69,plain,
( ~ in(X0,X1)
| ~ in(X0,X2)
| in(X0,set_intersection2(X2,X1)) ),
inference(cnf_transformation,[],[f152]) ).
cnf(c_85,negated_conjecture,
~ subset(sK6,set_intersection2(sK7,sK8)),
inference(cnf_transformation,[],[f130]) ).
cnf(c_86,negated_conjecture,
subset(sK6,sK8),
inference(cnf_transformation,[],[f129]) ).
cnf(c_87,negated_conjecture,
subset(sK6,sK7),
inference(cnf_transformation,[],[f128]) ).
cnf(c_1694,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),set_intersection2(sK7,sK8))
| subset(sK6,set_intersection2(sK7,sK8)) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_1695,plain,
( in(sK2(sK6,set_intersection2(sK7,sK8)),sK6)
| subset(sK6,set_intersection2(sK7,sK8)) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_1709,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK7)
| ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK8)
| in(sK2(sK6,set_intersection2(sK7,sK8)),set_intersection2(sK7,sK8)) ),
inference(instantiation,[status(thm)],[c_69]) ).
cnf(c_1743,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),X0)
| ~ subset(X0,sK8)
| in(sK2(sK6,set_intersection2(sK7,sK8)),sK8) ),
inference(instantiation,[status(thm)],[c_65]) ).
cnf(c_1893,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),X0)
| ~ subset(X0,X1)
| in(sK2(sK6,set_intersection2(sK7,sK8)),X1) ),
inference(instantiation,[status(thm)],[c_65]) ).
cnf(c_2042,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK6)
| ~ subset(sK6,sK8)
| in(sK2(sK6,set_intersection2(sK7,sK8)),sK8) ),
inference(instantiation,[status(thm)],[c_1743]) ).
cnf(c_2602,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK6)
| ~ subset(sK6,X0)
| in(sK2(sK6,set_intersection2(sK7,sK8)),X0) ),
inference(instantiation,[status(thm)],[c_1893]) ).
cnf(c_3793,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK6)
| ~ subset(sK6,sK7)
| in(sK2(sK6,set_intersection2(sK7,sK8)),sK7) ),
inference(instantiation,[status(thm)],[c_2602]) ).
cnf(c_3794,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3793,c_2042,c_1709,c_1694,c_1695,c_85,c_86,c_87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU128+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.16/0.35 % Computer : n021.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Wed Aug 23 19:05:24 EDT 2023
% 0.16/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.81/1.17 % SZS status Started for theBenchmark.p
% 3.81/1.17 % SZS status Theorem for theBenchmark.p
% 3.81/1.17
% 3.81/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.81/1.17
% 3.81/1.17 ------ iProver source info
% 3.81/1.17
% 3.81/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.81/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.81/1.17 git: non_committed_changes: false
% 3.81/1.17 git: last_make_outside_of_git: false
% 3.81/1.17
% 3.81/1.17 ------ Parsing...
% 3.81/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.81/1.17
% 3.81/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
% 3.81/1.17
% 3.81/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.81/1.17
% 3.81/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.81/1.17 ------ Proving...
% 3.81/1.17 ------ Problem Properties
% 3.81/1.17
% 3.81/1.17
% 3.81/1.17 clauses 52
% 3.81/1.17 conjectures 3
% 3.81/1.17 EPR 18
% 3.81/1.17 Horn 43
% 3.81/1.17 unary 17
% 3.81/1.17 binary 21
% 3.81/1.17 lits 103
% 3.81/1.17 lits eq 20
% 3.81/1.17 fd_pure 0
% 3.81/1.17 fd_pseudo 0
% 3.81/1.17 fd_cond 3
% 3.81/1.17 fd_pseudo_cond 8
% 3.81/1.17 AC symbols 0
% 3.81/1.17
% 3.81/1.17 ------ Input Options Time Limit: Unbounded
% 3.81/1.17
% 3.81/1.17
% 3.81/1.17 ------
% 3.81/1.17 Current options:
% 3.81/1.17 ------
% 3.81/1.17
% 3.81/1.17
% 3.81/1.17
% 3.81/1.17
% 3.81/1.17 ------ Proving...
% 3.81/1.17
% 3.81/1.17
% 3.81/1.17 % SZS status Theorem for theBenchmark.p
% 3.81/1.17
% 3.81/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.81/1.17
% 3.81/1.17
%------------------------------------------------------------------------------