TSTP Solution File: SET148+4 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET148+4 : TPTP v8.1.2. Released v2.2.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 15:06:49 EDT 2023
% Result : Theorem 3.29s 1.09s
% Output : CNFRefutation 3.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 42 ( 8 unt; 0 def)
% Number of atoms : 113 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 125 ( 54 ~; 46 |; 16 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 76 ( 1 sgn; 51 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_set) ).
fof(f4,axiom,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection) ).
fof(f12,conjecture,
! [X0] : equal_set(intersection(X0,X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI13) ).
fof(f13,negated_conjecture,
~ ! [X0] : equal_set(intersection(X0,X0),X0),
inference(negated_conjecture,[],[f12]) ).
fof(f15,plain,
! [X0,X1,X2] :
( member(X0,intersection(X1,X2))
<=> ( member(X0,X2)
& member(X0,X1) ) ),
inference(rectify,[],[f4]) ).
fof(f23,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f24,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f25,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f26,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(flattening,[],[f25]) ).
fof(f28,plain,
? [X0] : ~ equal_set(intersection(X0,X0),X0),
inference(ennf_transformation,[],[f13]) ).
fof(f29,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f30,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f29]) ).
fof(f31,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f30,f31]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) )
& ( ( member(X0,X2)
& member(X0,X1) )
| ~ member(X0,intersection(X1,X2)) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) )
& ( ( member(X0,X2)
& member(X0,X1) )
| ~ member(X0,intersection(X1,X2)) ) ),
inference(flattening,[],[f34]) ).
fof(f51,plain,
( ? [X0] : ~ equal_set(intersection(X0,X0),X0)
=> ~ equal_set(intersection(sK3,sK3),sK3) ),
introduced(choice_axiom,[]) ).
fof(f52,plain,
~ equal_set(intersection(sK3,sK3),sK3),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f28,f51]) ).
fof(f54,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f55,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f56,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f60,plain,
! [X2,X0,X1] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f35]) ).
fof(f61,plain,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f80,plain,
~ equal_set(intersection(sK3,sK3),sK3),
inference(cnf_transformation,[],[f52]) ).
cnf(c_49,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
cnf(c_50,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
cnf(c_52,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_55,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f61]) ).
cnf(c_56,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f60]) ).
cnf(c_76,negated_conjecture,
~ equal_set(intersection(sK3,sK3),sK3),
inference(cnf_transformation,[],[f80]) ).
cnf(c_426,plain,
( intersection(sK3,sK3) != X0
| X1 != sK3
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(resolution_lifted,[status(thm)],[c_52,c_76]) ).
cnf(c_427,plain,
( ~ subset(intersection(sK3,sK3),sK3)
| ~ subset(sK3,intersection(sK3,sK3)) ),
inference(unflattening,[status(thm)],[c_426]) ).
cnf(c_492,plain,
( ~ subset(intersection(sK3,sK3),sK3)
| ~ subset(sK3,intersection(sK3,sK3)) ),
inference(prop_impl_just,[status(thm)],[c_427]) ).
cnf(c_1316,plain,
( member(sK0(intersection(X0,X1),X2),X1)
| subset(intersection(X0,X1),X2) ),
inference(superposition,[status(thm)],[c_50,c_56]) ).
cnf(c_1319,plain,
( member(sK0(intersection(sK3,sK3),sK3),sK3)
| subset(intersection(sK3,sK3),sK3) ),
inference(instantiation,[status(thm)],[c_1316]) ).
cnf(c_1498,plain,
( member(sK0(sK3,intersection(sK3,sK3)),sK3)
| subset(sK3,intersection(sK3,sK3)) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_1757,plain,
( ~ member(sK0(X0,intersection(X1,X2)),X1)
| ~ member(sK0(X0,intersection(X1,X2)),X2)
| subset(X0,intersection(X1,X2)) ),
inference(superposition,[status(thm)],[c_55,c_49]) ).
cnf(c_1773,plain,
( ~ member(sK0(sK3,intersection(sK3,sK3)),sK3)
| subset(sK3,intersection(sK3,sK3)) ),
inference(instantiation,[status(thm)],[c_1757]) ).
cnf(c_1833,plain,
~ subset(intersection(sK3,sK3),sK3),
inference(global_subsumption_just,[status(thm)],[c_492,c_427,c_1498,c_1773]) ).
cnf(c_2073,plain,
( ~ member(sK0(intersection(sK3,sK3),sK3),sK3)
| subset(intersection(sK3,sK3),sK3) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_2075,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2073,c_1833,c_1319]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET148+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.10/0.30 % Computer : n023.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sat Aug 26 10:56:26 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.29/1.09 % SZS status Started for theBenchmark.p
% 3.29/1.09 % SZS status Theorem for theBenchmark.p
% 3.29/1.09
% 3.29/1.09 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.29/1.09
% 3.29/1.09 ------ iProver source info
% 3.29/1.09
% 3.29/1.09 git: date: 2023-05-31 18:12:56 +0000
% 3.29/1.09 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.29/1.09 git: non_committed_changes: false
% 3.29/1.09 git: last_make_outside_of_git: false
% 3.29/1.09
% 3.29/1.09 ------ Parsing...
% 3.29/1.09 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.29/1.09
% 3.29/1.09 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 3.29/1.09
% 3.29/1.09 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.29/1.09
% 3.29/1.09 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.29/1.09 ------ Proving...
% 3.29/1.09 ------ Problem Properties
% 3.29/1.09
% 3.29/1.09
% 3.29/1.09 clauses 27
% 3.29/1.09 conjectures 0
% 3.29/1.09 EPR 2
% 3.29/1.09 Horn 22
% 3.29/1.09 unary 4
% 3.29/1.09 binary 16
% 3.29/1.09 lits 57
% 3.29/1.09 lits eq 3
% 3.29/1.09 fd_pure 0
% 3.29/1.09 fd_pseudo 0
% 3.29/1.09 fd_cond 0
% 3.29/1.09 fd_pseudo_cond 2
% 3.29/1.09 AC symbols 0
% 3.29/1.09
% 3.29/1.09 ------ Schedule dynamic 5 is on
% 3.29/1.09
% 3.29/1.09 ------ no conjectures: strip conj schedule
% 3.29/1.09
% 3.29/1.09 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.29/1.09
% 3.29/1.09
% 3.29/1.09 ------
% 3.29/1.09 Current options:
% 3.29/1.09 ------
% 3.29/1.09
% 3.29/1.09
% 3.29/1.09
% 3.29/1.09
% 3.29/1.09 ------ Proving...
% 3.29/1.09
% 3.29/1.09
% 3.29/1.09 % SZS status Theorem for theBenchmark.p
% 3.29/1.09
% 3.29/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.29/1.09
% 3.29/1.09
%------------------------------------------------------------------------------