TSTP Solution File: SEU127+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU127+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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 1.79s 1.17s
% Output : CNFRefutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 7 unt; 0 def)
% Number of atoms : 130 ( 10 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 161 ( 61 ~; 59 |; 33 &)
% ( 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 : 73 ( 1 sgn; 55 !; 11 ?)
% 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(f23,conjecture,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f24,negated_conjecture,
~ ! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(negated_conjecture,[],[f23]) ).
fof(f43,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f48,plain,
? [X0,X1] : ~ subset(set_intersection2(X0,X1),X0),
inference(ennf_transformation,[],[f24]) ).
fof(f70,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,[],[f43]) ).
fof(f71,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,[],[f70]) ).
fof(f72,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f73,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])],[f71,f72]) ).
fof(f74,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(f75,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,[],[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) ) ) )
& ( ! [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,[],[f75]) ).
fof(f77,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(f78,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])],[f76,f77]) ).
fof(f84,plain,
( ? [X0,X1] : ~ subset(set_intersection2(X0,X1),X0)
=> ~ subset(set_intersection2(sK6,sK7),sK6) ),
introduced(choice_axiom,[]) ).
fof(f85,plain,
~ subset(set_intersection2(sK6,sK7),sK6),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f48,f84]) ).
fof(f105,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f106,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f73]) ).
fof(f107,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f78]) ).
fof(f125,plain,
~ subset(set_intersection2(sK6,sK7),sK6),
inference(cnf_transformation,[],[f85]) ).
fof(f149,plain,
! [X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f107]) ).
cnf(c_63,plain,
( ~ in(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f106]) ).
cnf(c_64,plain,
( in(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f105]) ).
cnf(c_71,plain,
( ~ in(X0,set_intersection2(X1,X2))
| in(X0,X1) ),
inference(cnf_transformation,[],[f149]) ).
cnf(c_84,negated_conjecture,
~ subset(set_intersection2(sK6,sK7),sK6),
inference(cnf_transformation,[],[f125]) ).
cnf(c_2336,plain,
( ~ in(sK2(set_intersection2(sK6,sK7),sK6),sK6)
| subset(set_intersection2(sK6,sK7),sK6) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_2337,plain,
( in(sK2(set_intersection2(sK6,sK7),sK6),set_intersection2(sK6,sK7))
| subset(set_intersection2(sK6,sK7),sK6) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_2476,plain,
( ~ in(sK2(set_intersection2(sK6,sK7),sK6),set_intersection2(sK6,sK7))
| in(sK2(set_intersection2(sK6,sK7),sK6),sK6) ),
inference(instantiation,[status(thm)],[c_71]) ).
cnf(c_2478,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2476,c_2337,c_2336,c_84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU127+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Aug 23 16:41:51 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.79/1.17 % SZS status Started for theBenchmark.p
% 1.79/1.17 % SZS status Theorem for theBenchmark.p
% 1.79/1.17
% 1.79/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.79/1.17
% 1.79/1.17 ------ iProver source info
% 1.79/1.17
% 1.79/1.17 git: date: 2023-05-31 18:12:56 +0000
% 1.79/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.79/1.17 git: non_committed_changes: false
% 1.79/1.17 git: last_make_outside_of_git: false
% 1.79/1.17
% 1.79/1.17 ------ Parsing...
% 1.79/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.79/1.17
% 1.79/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
% 1.79/1.17
% 1.79/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.79/1.17
% 1.79/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.79/1.17 ------ Proving...
% 1.79/1.17 ------ Problem Properties
% 1.79/1.17
% 1.79/1.17
% 1.79/1.17 clauses 49
% 1.79/1.17 conjectures 1
% 1.79/1.17 EPR 16
% 1.79/1.17 Horn 40
% 1.79/1.17 unary 14
% 1.79/1.17 binary 21
% 1.79/1.17 lits 100
% 1.79/1.17 lits eq 20
% 1.79/1.17 fd_pure 0
% 1.79/1.17 fd_pseudo 0
% 1.79/1.17 fd_cond 3
% 1.79/1.17 fd_pseudo_cond 8
% 1.79/1.17 AC symbols 0
% 1.79/1.17
% 1.79/1.17 ------ Schedule dynamic 5 is on
% 1.79/1.17
% 1.79/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.79/1.17
% 1.79/1.17
% 1.79/1.17 ------
% 1.79/1.17 Current options:
% 1.79/1.17 ------
% 1.79/1.17
% 1.79/1.17
% 1.79/1.17
% 1.79/1.17
% 1.79/1.17 ------ Proving...
% 1.79/1.17
% 1.79/1.17
% 1.79/1.17 % SZS status Theorem for theBenchmark.p
% 1.79/1.17
% 1.79/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.79/1.17
% 1.79/1.17
%------------------------------------------------------------------------------