TSTP Solution File: SET183+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET183+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 : 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 : Wed Aug 31 18:24:05 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 16 unt; 0 def)
% Number of atoms : 129 ( 20 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 125 ( 45 ~; 45 |; 25 &)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 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 : 87 ( 80 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f139,plain,
$false,
inference(subsumption_resolution,[],[f137,f80]) ).
fof(f80,plain,
~ subset(sK2,sF4),
inference(subsumption_resolution,[],[f78,f55]) ).
fof(f55,plain,
sF4 != sK2,
inference(definition_folding,[],[f47,f54]) ).
fof(f54,plain,
sF4 = intersection(sK2,sK3),
introduced(function_definition,[]) ).
fof(f47,plain,
sK2 != intersection(sK2,sK3),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
( subset(sK2,sK3)
& sK2 != intersection(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f13,f29]) ).
fof(f29,plain,
( ? [X0,X1] :
( subset(X0,X1)
& intersection(X0,X1) != X0 )
=> ( subset(sK2,sK3)
& sK2 != intersection(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
? [X0,X1] :
( subset(X0,X1)
& intersection(X0,X1) != X0 ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X1,X0] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X1,X0] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subset_intersection) ).
fof(f78,plain,
( sF4 = sK2
| ~ subset(sK2,sF4) ),
inference(resolution,[],[f34,f56]) ).
fof(f56,plain,
subset(sF4,sK2),
inference(superposition,[],[f43,f54]) ).
fof(f43,plain,
! [X0,X1] : subset(intersection(X0,X1),X0),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] : subset(intersection(X0,X1),X0),
inference(rectify,[],[f10]) ).
fof(f10,plain,
! [X1,X0] : subset(intersection(X1,X0),X1),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] : subset(intersection(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_is_subset) ).
fof(f34,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f137,plain,
subset(sK2,sF4),
inference(duplicate_literal_removal,[],[f131]) ).
fof(f131,plain,
( subset(sK2,sF4)
| subset(sK2,sF4) ),
inference(resolution,[],[f130,f45]) ).
fof(f45,plain,
! [X0,X1] :
( ~ member(sK1(X0,X1),X0)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ( ~ member(sK1(X0,X1),X0)
& member(sK1(X0,X1),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f26,f27]) ).
fof(f27,plain,
! [X0,X1] :
( ? [X3] :
( ~ member(X3,X0)
& member(X3,X1) )
=> ( ~ member(sK1(X0,X1),X0)
& member(sK1(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f26,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,[],[f25]) ).
fof(f25,plain,
! [X1,X0] :
( ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X1,X0] :
( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
<=> subset(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f130,plain,
! [X0] :
( member(sK1(X0,sK2),sF4)
| subset(sK2,X0) ),
inference(forward_demodulation,[],[f129,f54]) ).
fof(f129,plain,
! [X0] :
( subset(sK2,X0)
| member(sK1(X0,sK2),intersection(sK2,sK3)) ),
inference(forward_demodulation,[],[f128,f49]) ).
fof(f49,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(rectify,[],[f11]) ).
fof(f11,plain,
! [X1,X0] : 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(f128,plain,
! [X0] :
( subset(sK2,X0)
| member(sK1(X0,sK2),intersection(sK3,sK2)) ),
inference(duplicate_literal_removal,[],[f125]) ).
fof(f125,plain,
! [X0] :
( subset(sK2,X0)
| subset(sK2,X0)
| member(sK1(X0,sK2),intersection(sK3,sK2)) ),
inference(resolution,[],[f117,f44]) ).
fof(f44,plain,
! [X0,X1] :
( member(sK1(X0,X1),X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f117,plain,
! [X0,X1] :
( ~ member(sK1(X0,sK2),X1)
| member(sK1(X0,sK2),intersection(sK3,X1))
| subset(sK2,X0) ),
inference(resolution,[],[f100,f42]) ).
fof(f42,plain,
! [X2,X0,X1] :
( ~ member(X2,X0)
| member(X2,intersection(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,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,[],[f22]) ).
fof(f22,plain,
! [X0,X2,X1] :
( ( member(X1,intersection(X0,X2))
| ~ member(X1,X2)
| ~ member(X1,X0) )
& ( ( member(X1,X2)
& member(X1,X0) )
| ~ member(X1,intersection(X0,X2)) ) ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
! [X0,X2,X1] :
( ( member(X1,intersection(X0,X2))
| ~ member(X1,X2)
| ~ member(X1,X0) )
& ( ( member(X1,X2)
& member(X1,X0) )
| ~ member(X1,intersection(X0,X2)) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X2,X1] :
( member(X1,intersection(X0,X2))
<=> ( member(X1,X2)
& member(X1,X0) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X0,X2,X1] :
( ( member(X2,X0)
& member(X2,X1) )
<=> member(X2,intersection(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f100,plain,
! [X8] :
( member(sK1(X8,sK2),sK3)
| subset(sK2,X8) ),
inference(resolution,[],[f85,f48]) ).
fof(f48,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f30]) ).
fof(f85,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| subset(X1,X0)
| member(sK1(X0,X1),X2) ),
inference(resolution,[],[f46,f44]) ).
fof(f46,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| member(X2,X0)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET183+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_sat --cores 0 -t %d %s
% 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 : Tue Aug 30 13:28:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.49 % (10473)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.50 % (10474)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)
% 0.20/0.50 % (10474)Refutation not found, incomplete strategy% (10474)------------------------------
% 0.20/0.50 % (10474)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (10474)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (10474)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.50
% 0.20/0.50 % (10474)Memory used [KB]: 5373
% 0.20/0.50 % (10474)Time elapsed: 0.103 s
% 0.20/0.50 % (10474)Instructions burned: 2 (million)
% 0.20/0.50 % (10474)------------------------------
% 0.20/0.50 % (10474)------------------------------
% 0.20/0.50 % (10490)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.50 TRYING [1]
% 0.20/0.50 % (10482)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)
% 0.20/0.50 TRYING [2]
% 0.20/0.50 TRYING [3]
% 0.20/0.50 % (10497)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)
% 0.20/0.50 % (10475)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)
% 0.20/0.50 TRYING [4]
% 0.20/0.50 % (10488)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)
% 0.20/0.51 % (10487)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.51 % (10480)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.51 TRYING [5]
% 0.20/0.51 % (10481)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.51 % (10481)Instruction limit reached!
% 0.20/0.51 % (10481)------------------------------
% 0.20/0.51 % (10481)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (10481)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (10481)Termination reason: Unknown
% 0.20/0.51 % (10481)Termination phase: Saturation
% 0.20/0.51
% 0.20/0.51 % (10481)Memory used [KB]: 5373
% 0.20/0.51 % (10481)Time elapsed: 0.002 s
% 0.20/0.51 % (10481)Instructions burned: 2 (million)
% 0.20/0.51 % (10481)------------------------------
% 0.20/0.51 % (10481)------------------------------
% 0.20/0.51 TRYING [1]
% 0.20/0.51 TRYING [2]
% 0.20/0.51 TRYING [3]
% 0.20/0.51 % (10479)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)
% 0.20/0.52 % (10478)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.52 TRYING [4]
% 0.20/0.52 % (10488)First to succeed.
% 0.20/0.52 % (10488)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 % (10488)------------------------------
% 0.20/0.52 % (10488)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (10488)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (10488)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (10488)Memory used [KB]: 1023
% 0.20/0.52 % (10488)Time elapsed: 0.081 s
% 0.20/0.52 % (10488)Instructions burned: 5 (million)
% 0.20/0.52 % (10488)------------------------------
% 0.20/0.52 % (10488)------------------------------
% 0.20/0.52 % (10471)Success in time 0.171 s
%------------------------------------------------------------------------------