TSTP Solution File: SET201+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET201+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_uns --cores 0 -t %d %s
% Computer : n028.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:19:45 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 53 ( 10 unt; 0 def)
% Number of atoms : 143 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 145 ( 55 ~; 47 |; 31 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 96 ( 77 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f846,plain,
$false,
inference(subsumption_resolution,[],[f843,f47]) ).
fof(f47,plain,
~ subset(sF6,sF7),
inference(definition_folding,[],[f29,f46,f45]) ).
fof(f45,plain,
sF6 = intersection(sK1,sK3),
introduced(function_definition,[]) ).
fof(f46,plain,
intersection(sK0,sK2) = sF7,
introduced(function_definition,[]) ).
fof(f29,plain,
~ subset(intersection(sK1,sK3),intersection(sK0,sK2)),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
( subset(sK3,sK2)
& subset(sK1,sK0)
& ~ subset(intersection(sK1,sK3),intersection(sK0,sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f14,f15]) ).
fof(f15,plain,
( ? [X0,X1,X2,X3] :
( subset(X3,X2)
& subset(X1,X0)
& ~ subset(intersection(X1,X3),intersection(X0,X2)) )
=> ( subset(sK3,sK2)
& subset(sK1,sK0)
& ~ subset(intersection(sK1,sK3),intersection(sK0,sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
? [X0,X1,X2,X3] :
( subset(X3,X2)
& subset(X1,X0)
& ~ subset(intersection(X1,X3),intersection(X0,X2)) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
? [X3,X0,X1,X2] :
( subset(X2,X1)
& subset(X0,X3)
& ~ subset(intersection(X0,X2),intersection(X3,X1)) ),
inference(flattening,[],[f11]) ).
fof(f11,plain,
? [X3,X1,X0,X2] :
( ~ subset(intersection(X0,X2),intersection(X3,X1))
& subset(X2,X1)
& subset(X0,X3) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
~ ! [X3,X1,X0,X2] :
( ( subset(X2,X1)
& subset(X0,X3) )
=> subset(intersection(X0,X2),intersection(X3,X1)) ),
inference(rectify,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X0,X3,X2,X1] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> subset(intersection(X0,X2),intersection(X1,X3)) ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X0,X3,X2,X1] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> subset(intersection(X0,X2),intersection(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th41) ).
fof(f843,plain,
subset(sF6,sF7),
inference(duplicate_literal_removal,[],[f839]) ).
fof(f839,plain,
( subset(sF6,sF7)
| subset(sF6,sF7) ),
inference(resolution,[],[f837,f32]) ).
fof(f32,plain,
! [X0,X1] :
( member(sK4(X0,X1),X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ( ~ member(sK4(X0,X1),X0)
& member(sK4(X0,X1),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f18,f19]) ).
fof(f19,plain,
! [X0,X1] :
( ? [X3] :
( ~ member(X3,X0)
& member(X3,X1) )
=> ( ~ member(sK4(X0,X1),X0)
& member(sK4(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X3] :
( ~ member(X3,X0)
& member(X3,X1) ) ) ),
inference(rectify,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X2] :
( ~ member(X2,X0)
& member(X2,X1) ) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
<=> subset(X1,X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,plain,
! [X1,X0] :
( ! [X2] :
( member(X2,X1)
=> member(X2,X0) )
<=> subset(X1,X0) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f837,plain,
! [X2] :
( ~ member(sK4(sF7,X2),sF6)
| subset(X2,sF7) ),
inference(subsumption_resolution,[],[f830,f96]) ).
fof(f96,plain,
! [X0] :
( member(X0,sK0)
| ~ member(X0,sF6) ),
inference(resolution,[],[f88,f34]) ).
fof(f34,plain,
! [X2,X0,X1] :
( ~ subset(X1,X0)
| ~ member(X2,X1)
| member(X2,X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f88,plain,
subset(sF6,sK0),
inference(duplicate_literal_removal,[],[f87]) ).
fof(f87,plain,
( subset(sF6,sK0)
| subset(sF6,sK0) ),
inference(resolution,[],[f70,f32]) ).
fof(f70,plain,
! [X0] :
( ~ member(sK4(sK0,X0),sF6)
| subset(X0,sK0) ),
inference(resolution,[],[f66,f51]) ).
fof(f51,plain,
! [X0] :
( member(X0,sK1)
| ~ member(X0,sF6) ),
inference(superposition,[],[f39,f45]) ).
fof(f39,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,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(rectify,[],[f26]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ( member(X1,intersection(X2,X0))
| ~ member(X1,X0)
| ~ member(X1,X2) )
& ( ( member(X1,X0)
& member(X1,X2) )
| ~ member(X1,intersection(X2,X0)) ) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ( member(X1,intersection(X2,X0))
| ~ member(X1,X0)
| ~ member(X1,X2) )
& ( ( member(X1,X0)
& member(X1,X2) )
| ~ member(X1,intersection(X2,X0)) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X2,X0,X1] :
( member(X1,intersection(X2,X0))
<=> ( member(X1,X0)
& member(X1,X2) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X2,X0] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f66,plain,
! [X0] :
( ~ member(sK4(sK0,X0),sK1)
| subset(X0,sK0) ),
inference(resolution,[],[f63,f33]) ).
fof(f33,plain,
! [X0,X1] :
( ~ member(sK4(X0,X1),X0)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f63,plain,
! [X0] :
( member(X0,sK0)
| ~ member(X0,sK1) ),
inference(resolution,[],[f34,f30]) ).
fof(f30,plain,
subset(sK1,sK0),
inference(cnf_transformation,[],[f16]) ).
fof(f830,plain,
! [X2] :
( subset(X2,sF7)
| ~ member(sK4(sF7,X2),sK0)
| ~ member(sK4(sF7,X2),sF6) ),
inference(resolution,[],[f109,f100]) ).
fof(f100,plain,
! [X0] :
( member(X0,sK2)
| ~ member(X0,sF6) ),
inference(resolution,[],[f99,f34]) ).
fof(f99,plain,
subset(sF6,sK2),
inference(duplicate_literal_removal,[],[f98]) ).
fof(f98,plain,
( subset(sF6,sK2)
| subset(sF6,sK2) ),
inference(resolution,[],[f73,f32]) ).
fof(f73,plain,
! [X0] :
( ~ member(sK4(sK2,X0),sF6)
| subset(X0,sK2) ),
inference(resolution,[],[f67,f58]) ).
fof(f58,plain,
! [X0] :
( member(X0,sK3)
| ~ member(X0,sF6) ),
inference(superposition,[],[f40,f45]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f67,plain,
! [X0] :
( ~ member(sK4(sK2,X0),sK3)
| subset(X0,sK2) ),
inference(resolution,[],[f64,f33]) ).
fof(f64,plain,
! [X1] :
( member(X1,sK2)
| ~ member(X1,sK3) ),
inference(resolution,[],[f34,f31]) ).
fof(f31,plain,
subset(sK3,sK2),
inference(cnf_transformation,[],[f16]) ).
fof(f109,plain,
! [X2] :
( ~ member(sK4(sF7,X2),sK2)
| subset(X2,sF7)
| ~ member(sK4(sF7,X2),sK0) ),
inference(resolution,[],[f93,f33]) ).
fof(f93,plain,
! [X1] :
( member(X1,sF7)
| ~ member(X1,sK2)
| ~ member(X1,sK0) ),
inference(superposition,[],[f41,f46]) ).
fof(f41,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET201+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 13:36:03 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.50 % (7927)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.50 % (7908)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.51 % (7919)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.51 % (7927)Refutation not found, incomplete strategy% (7927)------------------------------
% 0.20/0.51 % (7927)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (7926)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.51 % (7919)Instruction limit reached!
% 0.20/0.51 % (7919)------------------------------
% 0.20/0.51 % (7919)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (7927)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (7927)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.51
% 0.20/0.51 % (7927)Memory used [KB]: 5884
% 0.20/0.51 % (7927)Time elapsed: 0.107 s
% 0.20/0.51 % (7927)Instructions burned: 1 (million)
% 0.20/0.51 % (7927)------------------------------
% 0.20/0.51 % (7927)------------------------------
% 0.20/0.51 % (7919)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (7919)Termination reason: Unknown
% 0.20/0.51 % (7919)Termination phase: Saturation
% 0.20/0.51
% 0.20/0.51 % (7919)Memory used [KB]: 6012
% 0.20/0.51 % (7919)Time elapsed: 0.122 s
% 0.20/0.51 % (7919)Instructions burned: 8 (million)
% 0.20/0.51 % (7919)------------------------------
% 0.20/0.51 % (7919)------------------------------
% 0.20/0.51 % (7931)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.52 % (7918)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.52 % (7926)Instruction limit reached!
% 0.20/0.52 % (7926)------------------------------
% 0.20/0.52 % (7926)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (7926)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (7926)Termination reason: Unknown
% 0.20/0.52 % (7926)Termination phase: Preprocessing 3
% 0.20/0.52
% 0.20/0.52 % (7926)Memory used [KB]: 1407
% 0.20/0.52 % (7926)Time elapsed: 0.003 s
% 0.20/0.52 % (7926)Instructions burned: 2 (million)
% 0.20/0.52 % (7926)------------------------------
% 0.20/0.52 % (7926)------------------------------
% 0.20/0.52 % (7912)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.52 % (7921)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (7911)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (7908)First to succeed.
% 0.20/0.52 % (7915)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.52 % (7918)Also succeeded, but the first one will report.
% 0.20/0.52 % (7913)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.52 % (7908)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (7908)------------------------------
% 0.20/0.52 % (7908)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (7908)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (7908)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (7908)Memory used [KB]: 6268
% 0.20/0.52 % (7908)Time elapsed: 0.116 s
% 0.20/0.52 % (7908)Instructions burned: 28 (million)
% 0.20/0.52 % (7908)------------------------------
% 0.20/0.52 % (7908)------------------------------
% 0.20/0.52 % (7907)Success in time 0.175 s
%------------------------------------------------------------------------------