TSTP Solution File: SET171+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET171+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 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 : Wed Aug 31 18:24:02 EDT 2022
% Result : Theorem 1.40s 0.59s
% Output : Refutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 8
% Syntax : Number of formulae : 85 ( 19 unt; 0 def)
% Number of atoms : 215 ( 19 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 232 ( 102 ~; 92 |; 27 &)
% ( 7 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 104 ( 92 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f141,plain,
$false,
inference(subsumption_resolution,[],[f139,f136]) ).
fof(f136,plain,
member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),sK2),
inference(subsumption_resolution,[],[f131,f135]) ).
fof(f135,plain,
~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),sK1),
inference(subsumption_resolution,[],[f134,f51]) ).
fof(f51,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) )
& ( member(X0,union(X1,X2))
| ( ~ member(X0,X2)
& ~ member(X0,X1) ) ) ),
inference(rectify,[],[f32]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) )
& ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) ) ),
inference(flattening,[],[f31]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) )
& ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X2,X0,X1] :
( ( member(X2,X1)
| member(X2,X0) )
<=> member(X2,union(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).
fof(f134,plain,
( ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),sK1)
| ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,sK2)) ),
inference(resolution,[],[f130,f51]) ).
fof(f130,plain,
( ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,sK3))
| ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,sK2)) ),
inference(resolution,[],[f127,f42]) ).
fof(f42,plain,
! [X2,X0,X1] :
( member(X2,intersection(X1,X0))
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X1,X0)) )
& ( member(X2,intersection(X1,X0))
| ~ member(X2,X1)
| ~ member(X2,X0) ) ),
inference(rectify,[],[f24]) ).
fof(f24,plain,
! [X0,X2,X1] :
( ( ( member(X1,X2)
& member(X1,X0) )
| ~ member(X1,intersection(X2,X0)) )
& ( member(X1,intersection(X2,X0))
| ~ member(X1,X2)
| ~ member(X1,X0) ) ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
! [X0,X2,X1] :
( ( ( member(X1,X2)
& member(X1,X0) )
| ~ member(X1,intersection(X2,X0)) )
& ( member(X1,intersection(X2,X0))
| ~ member(X1,X2)
| ~ member(X1,X0) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X2,X1] :
( ( member(X1,X2)
& member(X1,X0) )
<=> member(X1,intersection(X2,X0)) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X2,X0] :
( ( member(X2,X1)
& member(X2,X0) )
<=> member(X2,intersection(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f127,plain,
~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(union(sK1,sK2),union(sK1,sK3))),
inference(subsumption_resolution,[],[f126,f115]) ).
fof(f115,plain,
( member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK2)
| ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(union(sK1,sK2),union(sK1,sK3))) ),
inference(subsumption_resolution,[],[f109,f96]) ).
fof(f96,plain,
( ~ member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK1)
| ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(union(sK1,sK2),union(sK1,sK3))) ),
inference(resolution,[],[f89,f51]) ).
fof(f89,plain,
( ~ member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),union(sK1,intersection(sK2,sK3)))
| ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(union(sK1,sK2),union(sK1,sK3))) ),
inference(resolution,[],[f87,f39]) ).
fof(f39,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f19,f20]) ).
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(f19,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X3] :
( ~ member(X3,X1)
& member(X3,X0) ) ) ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
! [X1,X0] :
( ( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X2] :
( ~ member(X2,X0)
& member(X2,X1) ) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X1,X0] :
( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
<=> subset(X1,X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X1,X0)
<=> ! [X2] :
( member(X2,X1)
=> member(X2,X0) ) ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X1,X0] :
( ! [X2] :
( member(X2,X0)
=> member(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f87,plain,
( ~ subset(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3)))
| ~ member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),union(sK1,intersection(sK2,sK3))) ),
inference(resolution,[],[f84,f39]) ).
fof(f84,plain,
( ~ subset(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3)))
| ~ subset(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))) ),
inference(forward_demodulation,[],[f83,f46]) ).
fof(f46,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1,X0] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f83,plain,
( ~ subset(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3)))
| ~ subset(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK3),union(sK1,sK2))) ),
inference(forward_demodulation,[],[f76,f46]) ).
fof(f76,plain,
( ~ subset(intersection(union(sK1,sK3),union(sK1,sK2)),union(sK1,intersection(sK2,sK3)))
| ~ subset(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK3),union(sK1,sK2))) ),
inference(extensionality_resolution,[],[f48,f62]) ).
fof(f62,plain,
intersection(union(sK1,sK3),union(sK1,sK2)) != union(sK1,intersection(sK2,sK3)),
inference(backward_demodulation,[],[f45,f46]) ).
fof(f45,plain,
intersection(union(sK1,sK3),union(sK1,sK2)) != union(sK1,intersection(sK3,sK2)),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
intersection(union(sK1,sK3),union(sK1,sK2)) != union(sK1,intersection(sK3,sK2)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f26,f27]) ).
fof(f27,plain,
( ? [X0,X1,X2] : intersection(union(X0,X2),union(X0,X1)) != union(X0,intersection(X2,X1))
=> intersection(union(sK1,sK3),union(sK1,sK2)) != union(sK1,intersection(sK3,sK2)) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
? [X0,X1,X2] : intersection(union(X0,X2),union(X0,X1)) != union(X0,intersection(X2,X1)),
inference(rectify,[],[f17]) ).
fof(f17,plain,
? [X1,X2,X0] : intersection(union(X1,X0),union(X1,X2)) != union(X1,intersection(X0,X2)),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
~ ! [X0,X1,X2] : intersection(union(X1,X0),union(X1,X2)) = union(X1,intersection(X0,X2)),
inference(rectify,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X1,X0,X2] : union(X0,intersection(X1,X2)) = intersection(union(X0,X1),union(X0,X2)),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X1,X0,X2] : union(X0,intersection(X1,X2)) = intersection(union(X0,X1),union(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_union_distributes_over_intersection) ).
fof(f48,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ) ),
inference(flattening,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
<=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f109,plain,
( ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(union(sK1,sK2),union(sK1,sK3)))
| member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK2)
| member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK1) ),
inference(resolution,[],[f53,f99]) ).
fof(f99,plain,
( member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),union(sK1,sK2))
| ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(union(sK1,sK2),union(sK1,sK3))) ),
inference(resolution,[],[f91,f44]) ).
fof(f44,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X1,X0))
| member(X2,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f91,plain,
( member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),intersection(union(sK1,sK2),union(sK1,sK3)))
| ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(union(sK1,sK2),union(sK1,sK3))) ),
inference(resolution,[],[f88,f39]) ).
fof(f88,plain,
( ~ subset(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3)))
| member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),intersection(union(sK1,sK2),union(sK1,sK3))) ),
inference(resolution,[],[f84,f38]) ).
fof(f38,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f53,plain,
! [X2,X0,X1] :
( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f126,plain,
( ~ member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK2)
| ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(union(sK1,sK2),union(sK1,sK3))) ),
inference(duplicate_literal_removal,[],[f124]) ).
fof(f124,plain,
( ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(union(sK1,sK2),union(sK1,sK3)))
| ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(union(sK1,sK2),union(sK1,sK3)))
| ~ member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK2) ),
inference(resolution,[],[f118,f103]) ).
fof(f103,plain,
( ~ member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK3)
| ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(union(sK1,sK2),union(sK1,sK3)))
| ~ member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK2) ),
inference(resolution,[],[f42,f95]) ).
fof(f95,plain,
( ~ member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),intersection(sK2,sK3))
| ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(union(sK1,sK2),union(sK1,sK3))) ),
inference(resolution,[],[f89,f52]) ).
fof(f52,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f33]) ).
fof(f118,plain,
( member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK3)
| ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(union(sK1,sK2),union(sK1,sK3))) ),
inference(subsumption_resolution,[],[f111,f96]) ).
fof(f111,plain,
( member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK3)
| ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(union(sK1,sK2),union(sK1,sK3)))
| member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK1) ),
inference(resolution,[],[f53,f100]) ).
fof(f100,plain,
( member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),union(sK1,sK3))
| ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(union(sK1,sK2),union(sK1,sK3))) ),
inference(resolution,[],[f91,f43]) ).
fof(f43,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X1,X0))
| member(X2,X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f131,plain,
( member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),sK2)
| member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),sK1) ),
inference(resolution,[],[f129,f44]) ).
fof(f129,plain,
( member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),intersection(sK2,sK3))
| member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),sK1) ),
inference(resolution,[],[f123,f53]) ).
fof(f123,plain,
member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,intersection(sK2,sK3))),
inference(subsumption_resolution,[],[f121,f116]) ).
fof(f116,plain,
( member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK2)
| member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,intersection(sK2,sK3))) ),
inference(subsumption_resolution,[],[f110,f94]) ).
fof(f94,plain,
( ~ member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK1)
| member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,intersection(sK2,sK3))) ),
inference(resolution,[],[f90,f51]) ).
fof(f90,plain,
( ~ member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),union(sK1,intersection(sK2,sK3)))
| member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,intersection(sK2,sK3))) ),
inference(resolution,[],[f87,f38]) ).
fof(f110,plain,
( member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,intersection(sK2,sK3)))
| member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK1)
| member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK2) ),
inference(resolution,[],[f53,f97]) ).
fof(f97,plain,
( member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),union(sK1,sK2))
| member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,intersection(sK2,sK3))) ),
inference(resolution,[],[f92,f44]) ).
fof(f92,plain,
( member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),intersection(union(sK1,sK2),union(sK1,sK3)))
| member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,intersection(sK2,sK3))) ),
inference(resolution,[],[f88,f38]) ).
fof(f121,plain,
( member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,intersection(sK2,sK3)))
| ~ member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK2) ),
inference(duplicate_literal_removal,[],[f120]) ).
fof(f120,plain,
( member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,intersection(sK2,sK3)))
| member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,intersection(sK2,sK3)))
| ~ member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK2) ),
inference(resolution,[],[f117,f104]) ).
fof(f104,plain,
( ~ member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK3)
| ~ member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK2)
| member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,intersection(sK2,sK3))) ),
inference(resolution,[],[f42,f93]) ).
fof(f93,plain,
( ~ member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),intersection(sK2,sK3))
| member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,intersection(sK2,sK3))) ),
inference(resolution,[],[f90,f52]) ).
fof(f117,plain,
( member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK3)
| member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,intersection(sK2,sK3))) ),
inference(subsumption_resolution,[],[f112,f94]) ).
fof(f112,plain,
( member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK1)
| member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,intersection(sK2,sK3)))
| member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),sK3) ),
inference(resolution,[],[f53,f98]) ).
fof(f98,plain,
( member(sK0(intersection(union(sK1,sK2),union(sK1,sK3)),union(sK1,intersection(sK2,sK3))),union(sK1,sK3))
| member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,intersection(sK2,sK3))) ),
inference(resolution,[],[f92,f43]) ).
fof(f139,plain,
~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),sK2),
inference(resolution,[],[f138,f52]) ).
fof(f138,plain,
~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,sK2)),
inference(subsumption_resolution,[],[f133,f137]) ).
fof(f137,plain,
member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),sK3),
inference(subsumption_resolution,[],[f132,f135]) ).
fof(f132,plain,
( member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),sK3)
| member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),sK1) ),
inference(resolution,[],[f129,f43]) ).
fof(f133,plain,
( ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),union(sK1,sK2))
| ~ member(sK0(union(sK1,intersection(sK2,sK3)),intersection(union(sK1,sK2),union(sK1,sK3))),sK3) ),
inference(resolution,[],[f130,f52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET171+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 13:38:42 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.48 % (2794)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.48 % (2800)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.49 % (2817)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.49 % (2790)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.51 % (2795)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.51 % (2808)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51 % (2801)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51 % (2793)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.28/0.51 TRYING [1]
% 1.28/0.52 % (2821)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.28/0.52 TRYING [2]
% 1.28/0.52 TRYING [3]
% 1.28/0.52 % (2792)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 1.28/0.52 % (2810)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.28/0.52 TRYING [4]
% 1.28/0.53 % (2813)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 1.28/0.53 % (2799)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.28/0.53 % (2805)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 1.28/0.53 % (2803)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.28/0.53 % (2816)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.40/0.53 % (2815)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.40/0.53 % (2797)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.40/0.53 % (2796)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.40/0.54 % (2791)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.40/0.54 % (2802)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 1.40/0.54 % (2791)Refutation not found, incomplete strategy% (2791)------------------------------
% 1.40/0.54 % (2791)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.40/0.54 % (2791)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.40/0.54 % (2791)Termination reason: Refutation not found, incomplete strategy
% 1.40/0.54
% 1.40/0.54 % (2791)Memory used [KB]: 5373
% 1.40/0.54 % (2791)Time elapsed: 0.135 s
% 1.40/0.54 % (2791)Instructions burned: 3 (million)
% 1.40/0.54 % (2791)------------------------------
% 1.40/0.54 % (2791)------------------------------
% 1.40/0.54 % (2819)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.40/0.54 % (2807)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.40/0.54 TRYING [1]
% 1.40/0.54 TRYING [2]
% 1.40/0.54 TRYING [3]
% 1.40/0.55 % (2806)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.40/0.55 % (2818)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.40/0.55 % (2812)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 1.40/0.55 % (2798)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.40/0.55 TRYING [4]
% 1.40/0.55 % (2798)Instruction limit reached!
% 1.40/0.55 % (2798)------------------------------
% 1.40/0.55 % (2798)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.40/0.55 % (2798)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.40/0.55 % (2798)Termination reason: Unknown
% 1.40/0.55 % (2798)Termination phase: Blocked clause elimination
% 1.40/0.55
% 1.40/0.55 % (2798)Memory used [KB]: 895
% 1.40/0.55 % (2798)Time elapsed: 0.003 s
% 1.40/0.55 % (2798)Instructions burned: 2 (million)
% 1.40/0.55 % (2798)------------------------------
% 1.40/0.55 % (2798)------------------------------
% 1.40/0.55 % (2811)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.40/0.55 % (2812)First to succeed.
% 1.40/0.55 % (2809)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.40/0.56 % (2797)Instruction limit reached!
% 1.40/0.56 % (2797)------------------------------
% 1.40/0.56 % (2797)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.40/0.56 % (2797)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.40/0.56 % (2797)Termination reason: Unknown
% 1.40/0.56 % (2797)Termination phase: Saturation
% 1.40/0.56
% 1.40/0.56 % (2797)Memory used [KB]: 5500
% 1.40/0.56 % (2797)Time elapsed: 0.105 s
% 1.40/0.56 % (2797)Instructions burned: 7 (million)
% 1.40/0.56 % (2797)------------------------------
% 1.40/0.56 % (2797)------------------------------
% 1.40/0.56 TRYING [1]
% 1.40/0.56 TRYING [2]
% 1.40/0.56 TRYING [3]
% 1.40/0.56 % (2804)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.40/0.56 TRYING [4]
% 1.40/0.56 % (2800)Instruction limit reached!
% 1.40/0.56 % (2800)------------------------------
% 1.40/0.56 % (2800)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.40/0.56 % (2800)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.40/0.56 % (2800)Termination reason: Unknown
% 1.40/0.56 % (2800)Termination phase: Saturation
% 1.40/0.56
% 1.40/0.56 % (2800)Memory used [KB]: 6268
% 1.40/0.56 % (2800)Time elapsed: 0.161 s
% 1.40/0.56 % (2800)Instructions burned: 51 (million)
% 1.40/0.56 % (2800)------------------------------
% 1.40/0.56 % (2800)------------------------------
% 1.40/0.57 % (2794)Instruction limit reached!
% 1.40/0.57 % (2794)------------------------------
% 1.40/0.57 % (2794)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.40/0.57 % (2794)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.40/0.57 % (2794)Termination reason: Unknown
% 1.40/0.57 % (2794)Termination phase: Saturation
% 1.40/0.57
% 1.40/0.57 % (2794)Memory used [KB]: 6268
% 1.40/0.57 % (2794)Time elapsed: 0.170 s
% 1.40/0.57 % (2794)Instructions burned: 51 (million)
% 1.40/0.57 % (2794)------------------------------
% 1.40/0.57 % (2794)------------------------------
% 1.40/0.59 % (2812)Refutation found. Thanks to Tanya!
% 1.40/0.59 % SZS status Theorem for theBenchmark
% 1.40/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.40/0.59 % (2812)------------------------------
% 1.40/0.59 % (2812)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.40/0.59 % (2812)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.40/0.59 % (2812)Termination reason: Refutation
% 1.40/0.59
% 1.40/0.59 % (2812)Memory used [KB]: 1023
% 1.40/0.59 % (2812)Time elapsed: 0.128 s
% 1.40/0.59 % (2812)Instructions burned: 12 (million)
% 1.40/0.59 % (2812)------------------------------
% 1.40/0.59 % (2812)------------------------------
% 1.40/0.59 % (2786)Success in time 0.227 s
%------------------------------------------------------------------------------