TSTP Solution File: SET629+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET629+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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:08:47 EDT 2023
% Result : Theorem 2.28s 1.16s
% Output : CNFRefutation 2.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 9 unt; 0 def)
% Number of atoms : 99 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 109 ( 47 ~; 36 |; 19 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 84 ( 4 sgn; 53 !; 8 ?)
% 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,X2] :
( member(X2,difference(X0,X1))
<=> ( ~ member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
fof(f3,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).
fof(f4,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> ~ intersect(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',disjoint_defn) ).
fof(f8,conjecture,
! [X0,X1] : disjoint(intersection(X0,X1),difference(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_and_difference_disjoint) ).
fof(f9,negated_conjecture,
~ ! [X0,X1] : disjoint(intersection(X0,X1),difference(X0,X1)),
inference(negated_conjecture,[],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
=> disjoint(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f11,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f13,plain,
? [X0,X1] : ~ disjoint(intersection(X0,X1),difference(X0,X1)),
inference(ennf_transformation,[],[f9]) ).
fof(f14,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(f15,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,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) )
& ( ( ~ member(X2,X1)
& member(X2,X0) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) )
& ( ( ~ member(X2,X1)
& member(X2,X0) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ? [X2] :
( member(X2,X1)
& member(X2,X0) )
| ~ intersect(X0,X1) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f19,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
| ~ intersect(X0,X1) ) ),
inference(rectify,[],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
=> ( member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ( member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) )
| ~ intersect(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f19,f20]) ).
fof(f26,plain,
( ? [X0,X1] : ~ disjoint(intersection(X0,X1),difference(X0,X1))
=> ~ disjoint(intersection(sK2,sK3),difference(sK2,sK3)) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
~ disjoint(intersection(sK2,sK3),difference(sK2,sK3)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f13,f26]) ).
fof(f29,plain,
! [X2,X0,X1] :
( member(X2,X1)
| ~ member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[],[f15]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| ~ member(X2,difference(X0,X1)) ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f35,plain,
! [X0,X1] :
( member(sK0(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f37,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f44,plain,
~ disjoint(intersection(sK2,sK3),difference(sK2,sK3)),
inference(cnf_transformation,[],[f27]) ).
cnf(c_50,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_53,plain,
( ~ member(X0,difference(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_56,plain,
( ~ intersect(X0,X1)
| member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_57,plain,
( ~ intersect(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_58,plain,
( intersect(X0,X1)
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_63,negated_conjecture,
~ disjoint(intersection(sK2,sK3),difference(sK2,sK3)),
inference(cnf_transformation,[],[f44]) ).
cnf(c_207,plain,
( intersection(sK2,sK3) != X0
| difference(sK2,sK3) != X1
| intersect(X0,X1) ),
inference(resolution_lifted,[status(thm)],[c_58,c_63]) ).
cnf(c_208,plain,
intersect(intersection(sK2,sK3),difference(sK2,sK3)),
inference(unflattening,[status(thm)],[c_207]) ).
cnf(c_602,plain,
( ~ intersect(intersection(X0,X1),X2)
| member(sK0(intersection(X0,X1),X2),X1) ),
inference(superposition,[status(thm)],[c_57,c_50]) ).
cnf(c_616,plain,
( ~ member(sK0(X0,difference(X1,X2)),X2)
| ~ intersect(X0,difference(X1,X2)) ),
inference(superposition,[status(thm)],[c_56,c_53]) ).
cnf(c_973,plain,
~ intersect(intersection(X0,X1),difference(X2,X1)),
inference(superposition,[status(thm)],[c_602,c_616]) ).
cnf(c_981,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_208,c_973]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET629+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n019.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 : Sat Aug 26 11:48:43 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.28/1.16 % SZS status Started for theBenchmark.p
% 2.28/1.16 % SZS status Theorem for theBenchmark.p
% 2.28/1.16
% 2.28/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.28/1.16
% 2.28/1.16 ------ iProver source info
% 2.28/1.16
% 2.28/1.16 git: date: 2023-05-31 18:12:56 +0000
% 2.28/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.28/1.16 git: non_committed_changes: false
% 2.28/1.16 git: last_make_outside_of_git: false
% 2.28/1.16
% 2.28/1.16 ------ Parsing...
% 2.28/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.28/1.16
% 2.28/1.16 ------ 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
% 2.28/1.16
% 2.28/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.28/1.16
% 2.28/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.28/1.16 ------ Proving...
% 2.28/1.16 ------ Problem Properties
% 2.28/1.16
% 2.28/1.16
% 2.28/1.16 clauses 14
% 2.28/1.16 conjectures 0
% 2.28/1.16 EPR 2
% 2.28/1.16 Horn 12
% 2.28/1.16 unary 2
% 2.28/1.16 binary 7
% 2.28/1.16 lits 31
% 2.28/1.16 lits eq 3
% 2.28/1.16 fd_pure 0
% 2.28/1.16 fd_pseudo 0
% 2.28/1.16 fd_cond 0
% 2.28/1.16 fd_pseudo_cond 2
% 2.28/1.16 AC symbols 0
% 2.28/1.16
% 2.28/1.16 ------ Schedule dynamic 5 is on
% 2.28/1.16
% 2.28/1.16 ------ no conjectures: strip conj schedule
% 2.28/1.16
% 2.28/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.28/1.16
% 2.28/1.16
% 2.28/1.16 ------
% 2.28/1.16 Current options:
% 2.28/1.16 ------
% 2.28/1.16
% 2.28/1.16
% 2.28/1.16
% 2.28/1.16
% 2.28/1.16 ------ Proving...
% 2.28/1.16
% 2.28/1.16
% 2.28/1.16 % SZS status Theorem for theBenchmark.p
% 2.28/1.16
% 2.28/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.28/1.16
% 2.28/1.16
%------------------------------------------------------------------------------