TSTP Solution File: SET586+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET586+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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 : Fri May 3 03:00:50 EDT 2024
% Result : Theorem 3.09s 1.11s
% Output : CNFRefutation 3.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 45 ( 11 unt; 0 def)
% Number of atoms : 116 ( 7 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 127 ( 56 ~; 46 |; 17 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 85 ( 2 sgn 52 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f3,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f6,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(intersection(X0,X2),intersection(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_of_subset) ).
fof(f7,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> subset(intersection(X0,X2),intersection(X1,X2)) ),
inference(negated_conjecture,[],[f6]) ).
fof(f8,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
? [X0,X1,X2] :
( ~ subset(intersection(X0,X2),intersection(X1,X2))
& subset(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f10,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f10]) ).
fof(f12,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,[],[f8]) ).
fof(f13,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,[],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f15,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])],[f13,f14]) ).
fof(f20,plain,
( ? [X0,X1,X2] :
( ~ subset(intersection(X0,X2),intersection(X1,X2))
& subset(X0,X1) )
=> ( ~ subset(intersection(sK2,sK4),intersection(sK3,sK4))
& subset(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
( ~ subset(intersection(sK2,sK4),intersection(sK3,sK4))
& subset(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f9,f20]) ).
fof(f22,plain,
! [X2,X0,X1] :
( member(X2,X0)
| ~ member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f23,plain,
! [X2,X0,X1] :
( member(X2,X1)
| ~ member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f24,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f25,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f27,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f28,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f34,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f21]) ).
fof(f35,plain,
~ subset(intersection(sK2,sK4),intersection(sK3,sK4)),
inference(cnf_transformation,[],[f21]) ).
cnf(c_49,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_50,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_51,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_52,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_53,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_54,plain,
( ~ member(X0,X1)
| ~ subset(X1,X2)
| member(X0,X2) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_55,plain,
intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f28]) ).
cnf(c_59,negated_conjecture,
~ subset(intersection(sK2,sK4),intersection(sK3,sK4)),
inference(cnf_transformation,[],[f35]) ).
cnf(c_60,negated_conjecture,
subset(sK2,sK3),
inference(cnf_transformation,[],[f34]) ).
cnf(c_115,plain,
~ subset(intersection(sK2,sK4),intersection(sK4,sK3)),
inference(demodulation,[status(thm)],[c_59,c_55]) ).
cnf(c_193,plain,
( intersection(sK2,sK4) != X0
| intersection(sK4,sK3) != X1
| member(sK0(X0,X1),X0) ),
inference(resolution_lifted,[status(thm)],[c_53,c_115]) ).
cnf(c_194,plain,
member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),intersection(sK2,sK4)),
inference(unflattening,[status(thm)],[c_193]) ).
cnf(c_198,plain,
( intersection(sK2,sK4) != X0
| intersection(sK4,sK3) != X1
| ~ member(sK0(X0,X1),X1) ),
inference(resolution_lifted,[status(thm)],[c_52,c_115]) ).
cnf(c_199,plain,
~ member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),intersection(sK4,sK3)),
inference(unflattening,[status(thm)],[c_198]) ).
cnf(c_565,plain,
( ~ member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),intersection(sK2,sK4))
| member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),sK2) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_566,plain,
( ~ member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),intersection(sK2,sK4))
| member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),sK4) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_741,plain,
( ~ member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),sK2)
| ~ subset(sK2,X0)
| member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),X0) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_829,plain,
( ~ member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),X0)
| ~ member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),sK4)
| member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),intersection(sK4,X0)) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_2055,plain,
( ~ member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),sK4)
| ~ member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),sK3)
| member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),intersection(sK4,sK3)) ),
inference(instantiation,[status(thm)],[c_829]) ).
cnf(c_3330,plain,
( ~ member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),sK2)
| ~ subset(sK2,sK3)
| member(sK0(intersection(sK2,sK4),intersection(sK4,sK3)),sK3) ),
inference(instantiation,[status(thm)],[c_741]) ).
cnf(c_3332,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3330,c_2055,c_565,c_566,c_199,c_194,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SET586+3 : TPTP v8.1.2. Released v2.2.0.
% 0.09/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n029.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu May 2 20:58:52 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.09/1.11 % SZS status Started for theBenchmark.p
% 3.09/1.11 % SZS status Theorem for theBenchmark.p
% 3.09/1.11
% 3.09/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.09/1.11
% 3.09/1.11 ------ iProver source info
% 3.09/1.11
% 3.09/1.11 git: date: 2024-05-02 19:28:25 +0000
% 3.09/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.09/1.11 git: non_committed_changes: false
% 3.09/1.11
% 3.09/1.11 ------ Parsing...
% 3.09/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.09/1.11
% 3.09/1.11 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.09/1.11
% 3.09/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.09/1.11
% 3.09/1.11 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.09/1.11 ------ Proving...
% 3.09/1.11 ------ Problem Properties
% 3.09/1.11
% 3.09/1.11
% 3.09/1.11 clauses 12
% 3.09/1.11 conjectures 1
% 3.09/1.11 EPR 3
% 3.09/1.11 Horn 10
% 3.09/1.11 unary 4
% 3.09/1.11 binary 4
% 3.09/1.11 lits 24
% 3.09/1.11 lits eq 3
% 3.09/1.11 fd_pure 0
% 3.09/1.11 fd_pseudo 0
% 3.09/1.11 fd_cond 0
% 3.09/1.11 fd_pseudo_cond 2
% 3.09/1.11 AC symbols 0
% 3.09/1.11
% 3.09/1.11 ------ Schedule dynamic 5 is on
% 3.09/1.11
% 3.09/1.11 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.09/1.11
% 3.09/1.11
% 3.09/1.11 ------
% 3.09/1.11 Current options:
% 3.09/1.11 ------
% 3.09/1.11
% 3.09/1.11
% 3.09/1.11
% 3.09/1.11
% 3.09/1.11 ------ Proving...
% 3.09/1.11
% 3.09/1.11
% 3.09/1.11 % SZS status Theorem for theBenchmark.p
% 3.09/1.11
% 3.09/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.09/1.11
% 3.09/1.12
%------------------------------------------------------------------------------