TSTP Solution File: SET630+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET630+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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 0.98s 1.18s
% Output : CNFRefutation 0.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 20 unt; 0 def)
% Number of atoms : 66 ( 5 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 61 ( 31 ~; 22 |; 5 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn; 36 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetric_difference_defn) ).
fof(f2,axiom,
! [X0,X1,X2] :
( intersect(X0,union(X1,X2))
<=> ( intersect(X0,X2)
| intersect(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_with_union) ).
fof(f3,axiom,
! [X0,X1] : disjoint(intersection(X0,X1),difference(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_and_union_disjoint) ).
fof(f6,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> ~ intersect(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',disjoint_defn) ).
fof(f8,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f12,conjecture,
! [X0,X1] : disjoint(intersection(X0,X1),symmetric_difference(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_and_symmetric_difference_disjoint) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] : disjoint(intersection(X0,X1),symmetric_difference(X0,X1)),
inference(negated_conjecture,[],[f12]) ).
fof(f15,plain,
? [X0,X1] : ~ disjoint(intersection(X0,X1),symmetric_difference(X0,X1)),
inference(ennf_transformation,[],[f13]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( intersect(X0,union(X1,X2))
| ( ~ intersect(X0,X2)
& ~ intersect(X0,X1) ) )
& ( intersect(X0,X2)
| intersect(X0,X1)
| ~ intersect(X0,union(X1,X2)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( intersect(X0,union(X1,X2))
| ( ~ intersect(X0,X2)
& ~ intersect(X0,X1) ) )
& ( intersect(X0,X2)
| intersect(X0,X1)
| ~ intersect(X0,union(X1,X2)) ) ),
inference(flattening,[],[f16]) ).
fof(f24,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| intersect(X0,X1) )
& ( ~ intersect(X0,X1)
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f29,plain,
( ? [X0,X1] : ~ disjoint(intersection(X0,X1),symmetric_difference(X0,X1))
=> ~ disjoint(intersection(sK2,sK3),symmetric_difference(sK2,sK3)) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
~ disjoint(intersection(sK2,sK3),symmetric_difference(sK2,sK3)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f15,f29]) ).
fof(f31,plain,
! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
inference(cnf_transformation,[],[f1]) ).
fof(f32,plain,
! [X2,X0,X1] :
( intersect(X0,X2)
| intersect(X0,X1)
| ~ intersect(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f17]) ).
fof(f35,plain,
! [X0,X1] : disjoint(intersection(X0,X1),difference(X0,X1)),
inference(cnf_transformation,[],[f3]) ).
fof(f42,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f43,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f45,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f52,plain,
~ disjoint(intersection(sK2,sK3),symmetric_difference(sK2,sK3)),
inference(cnf_transformation,[],[f30]) ).
fof(f54,plain,
~ disjoint(intersection(sK2,sK3),union(difference(sK2,sK3),difference(sK3,sK2))),
inference(definition_unfolding,[],[f52,f31]) ).
cnf(c_51,plain,
( ~ intersect(X0,union(X1,X2))
| intersect(X0,X1)
| intersect(X0,X2) ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_52,plain,
disjoint(intersection(X0,X1),difference(X0,X1)),
inference(cnf_transformation,[],[f35]) ).
cnf(c_59,plain,
( intersect(X0,X1)
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
cnf(c_60,plain,
( ~ intersect(X0,X1)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_62,plain,
intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f45]) ).
cnf(c_67,negated_conjecture,
~ disjoint(intersection(sK2,sK3),union(difference(sK2,sK3),difference(sK3,sK2))),
inference(cnf_transformation,[],[f54]) ).
cnf(c_82,plain,
( ~ disjoint(X0,X1)
| ~ intersect(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_60]) ).
cnf(c_83,plain,
( ~ intersect(X0,X1)
| ~ disjoint(X0,X1) ),
inference(renaming,[status(thm)],[c_82]) ).
cnf(c_145,plain,
( ~ intersect(X0,union(X1,X2))
| ~ disjoint(X0,X1)
| intersect(X0,X2) ),
inference(bin_hyper_res,[status(thm)],[c_51,c_83]) ).
cnf(c_911,plain,
intersect(intersection(sK2,sK3),union(difference(sK2,sK3),difference(sK3,sK2))),
inference(superposition,[status(thm)],[c_59,c_67]) ).
cnf(c_937,plain,
disjoint(intersection(X0,X1),difference(X1,X0)),
inference(superposition,[status(thm)],[c_62,c_52]) ).
cnf(c_1573,plain,
( ~ disjoint(intersection(sK2,sK3),difference(sK2,sK3))
| intersect(intersection(sK2,sK3),difference(sK3,sK2)) ),
inference(superposition,[status(thm)],[c_911,c_145]) ).
cnf(c_1590,plain,
intersect(intersection(sK2,sK3),difference(sK3,sK2)),
inference(forward_subsumption_resolution,[status(thm)],[c_1573,c_52]) ).
cnf(c_1734,plain,
~ disjoint(intersection(sK2,sK3),difference(sK3,sK2)),
inference(superposition,[status(thm)],[c_1590,c_60]) ).
cnf(c_1735,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1734,c_937]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET630+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 13:41:15 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.98/1.18 % SZS status Started for theBenchmark.p
% 0.98/1.18 % SZS status Theorem for theBenchmark.p
% 0.98/1.18
% 0.98/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.98/1.18
% 0.98/1.18 ------ iProver source info
% 0.98/1.18
% 0.98/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.98/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.98/1.18 git: non_committed_changes: false
% 0.98/1.18 git: last_make_outside_of_git: false
% 0.98/1.18
% 0.98/1.18 ------ Parsing...
% 0.98/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.98/1.18
% 0.98/1.18 ------ 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
% 0.98/1.18
% 0.98/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.98/1.18
% 0.98/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.98/1.18 ------ Proving...
% 0.98/1.18 ------ Problem Properties
% 0.98/1.18
% 0.98/1.18
% 0.98/1.18 clauses 18
% 0.98/1.18 conjectures 1
% 0.98/1.18 EPR 4
% 0.98/1.18 Horn 12
% 0.98/1.18 unary 4
% 0.98/1.18 binary 9
% 0.98/1.18 lits 37
% 0.98/1.18 lits eq 4
% 0.98/1.18 fd_pure 0
% 0.98/1.18 fd_pseudo 0
% 0.98/1.18 fd_cond 0
% 0.98/1.18 fd_pseudo_cond 2
% 0.98/1.18 AC symbols 0
% 0.98/1.18
% 0.98/1.18 ------ Schedule dynamic 5 is on
% 0.98/1.18
% 0.98/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.98/1.18
% 0.98/1.18
% 0.98/1.18 ------
% 0.98/1.18 Current options:
% 0.98/1.18 ------
% 0.98/1.18
% 0.98/1.18
% 0.98/1.18
% 0.98/1.18
% 0.98/1.18 ------ Proving...
% 0.98/1.18
% 0.98/1.18
% 0.98/1.18 % SZS status Theorem for theBenchmark.p
% 0.98/1.18
% 0.98/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.98/1.18
% 0.98/1.18
%------------------------------------------------------------------------------