TSTP Solution File: SET072+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET072+1 : TPTP v8.1.0. Bugfixed v5.4.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 : n010.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:23:31 EDT 2022
% Result : Theorem 0.19s 0.60s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 11 unt; 0 def)
% Number of atoms : 95 ( 47 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 92 ( 28 ~; 23 |; 35 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 44 ( 32 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f324,plain,
$false,
inference(subsumption_resolution,[],[f323,f306]) ).
fof(f306,plain,
sK3 != sK2,
inference(backward_demodulation,[],[f201,f303]) ).
fof(f303,plain,
sK2 = sK4,
inference(subsumption_resolution,[],[f301,f201]) ).
fof(f301,plain,
( sK3 = sK4
| sK2 = sK4 ),
inference(resolution,[],[f192,f297]) ).
fof(f297,plain,
member(sK4,unordered_pair(sK3,sK2)),
inference(subsumption_resolution,[],[f296,f202]) ).
fof(f202,plain,
member(sK4,universal_class),
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
( member(sK4,universal_class)
& sK3 != sK4
& unordered_pair(sK4,sK2) = unordered_pair(sK3,sK2)
& member(sK3,universal_class) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f118,f119]) ).
fof(f119,plain,
( ? [X0,X1,X2] :
( member(X2,universal_class)
& X1 != X2
& unordered_pair(X1,X0) = unordered_pair(X2,X0)
& member(X1,universal_class) )
=> ( member(sK4,universal_class)
& sK3 != sK4
& unordered_pair(sK4,sK2) = unordered_pair(sK3,sK2)
& member(sK3,universal_class) ) ),
introduced(choice_axiom,[]) ).
fof(f118,plain,
? [X0,X1,X2] :
( member(X2,universal_class)
& X1 != X2
& unordered_pair(X1,X0) = unordered_pair(X2,X0)
& member(X1,universal_class) ),
inference(rectify,[],[f77]) ).
fof(f77,plain,
? [X1,X0,X2] :
( member(X2,universal_class)
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X1)
& member(X0,universal_class) ),
inference(flattening,[],[f76]) ).
fof(f76,plain,
? [X1,X2,X0] :
( X0 != X2
& member(X0,universal_class)
& unordered_pair(X0,X1) = unordered_pair(X2,X1)
& member(X2,universal_class) ),
inference(ennf_transformation,[],[f60]) ).
fof(f60,plain,
~ ! [X1,X2,X0] :
( ( member(X0,universal_class)
& unordered_pair(X0,X1) = unordered_pair(X2,X1)
& member(X2,universal_class) )
=> X0 = X2 ),
inference(rectify,[],[f45]) ).
fof(f45,negated_conjecture,
~ ! [X1,X4,X0] :
( ( member(X1,universal_class)
& member(X0,universal_class)
& unordered_pair(X0,X4) = unordered_pair(X1,X4) )
=> X0 = X1 ),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
! [X1,X4,X0] :
( ( member(X1,universal_class)
& member(X0,universal_class)
& unordered_pair(X0,X4) = unordered_pair(X1,X4) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_cancellation) ).
fof(f296,plain,
( ~ member(sK4,universal_class)
| member(sK4,unordered_pair(sK3,sK2)) ),
inference(superposition,[],[f288,f200]) ).
fof(f200,plain,
unordered_pair(sK4,sK2) = unordered_pair(sK3,sK2),
inference(cnf_transformation,[],[f120]) ).
fof(f288,plain,
! [X2,X1] :
( member(X2,unordered_pair(X2,X1))
| ~ member(X2,universal_class) ),
inference(equality_resolution,[],[f193]) ).
fof(f193,plain,
! [X2,X0,X1] :
( member(X2,unordered_pair(X0,X1))
| X0 != X2
| ~ member(X2,universal_class) ),
inference(cnf_transformation,[],[f113]) ).
fof(f113,plain,
! [X0,X1,X2] :
( ( member(X2,unordered_pair(X0,X1))
| ( X1 != X2
& X0 != X2 )
| ~ member(X2,universal_class) )
& ( ( ( X1 = X2
| X0 = X2 )
& member(X2,universal_class) )
| ~ member(X2,unordered_pair(X0,X1)) ) ),
inference(rectify,[],[f112]) ).
fof(f112,plain,
! [X2,X1,X0] :
( ( member(X0,unordered_pair(X2,X1))
| ( X0 != X1
& X0 != X2 )
| ~ member(X0,universal_class) )
& ( ( ( X0 = X1
| X0 = X2 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X2,X1)) ) ),
inference(flattening,[],[f111]) ).
fof(f111,plain,
! [X2,X1,X0] :
( ( member(X0,unordered_pair(X2,X1))
| ( X0 != X1
& X0 != X2 )
| ~ member(X0,universal_class) )
& ( ( ( X0 = X1
| X0 = X2 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X2,X1)) ) ),
inference(nnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X2,X1,X0] :
( member(X0,unordered_pair(X2,X1))
<=> ( ( X0 = X1
| X0 = X2 )
& member(X0,universal_class) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X2,X1,X0] :
( ( member(X2,universal_class)
& ( X0 = X2
| X1 = X2 ) )
<=> member(X2,unordered_pair(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_defn) ).
fof(f192,plain,
! [X2,X0,X1] :
( ~ member(X2,unordered_pair(X0,X1))
| X1 = X2
| X0 = X2 ),
inference(cnf_transformation,[],[f113]) ).
fof(f201,plain,
sK3 != sK4,
inference(cnf_transformation,[],[f120]) ).
fof(f323,plain,
sK3 = sK2,
inference(duplicate_literal_removal,[],[f321]) ).
fof(f321,plain,
( sK3 = sK2
| sK3 = sK2 ),
inference(resolution,[],[f317,f192]) ).
fof(f317,plain,
member(sK3,unordered_pair(sK2,sK2)),
inference(subsumption_resolution,[],[f313,f199]) ).
fof(f199,plain,
member(sK3,universal_class),
inference(cnf_transformation,[],[f120]) ).
fof(f313,plain,
( member(sK3,unordered_pair(sK2,sK2))
| ~ member(sK3,universal_class) ),
inference(superposition,[],[f288,f308]) ).
fof(f308,plain,
unordered_pair(sK3,sK2) = unordered_pair(sK2,sK2),
inference(backward_demodulation,[],[f200,f303]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET072+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.10/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.34 % Computer : n010.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:01:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.55 % (16654)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.19/0.56 % (16671)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)
% 0.19/0.57 % (16672)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.19/0.57 % (16662)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.19/0.57 % (16664)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.19/0.58 % (16655)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.59 % (16655)Instruction limit reached!
% 0.19/0.59 % (16655)------------------------------
% 0.19/0.59 % (16655)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.59 % (16655)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.59 % (16655)Termination reason: Unknown
% 0.19/0.59 % (16655)Termination phase: Saturation
% 0.19/0.59
% 0.19/0.59 % (16655)Memory used [KB]: 5500
% 0.19/0.59 % (16655)Time elapsed: 0.097 s
% 0.19/0.59 % (16655)Instructions burned: 7 (million)
% 0.19/0.59 % (16655)------------------------------
% 0.19/0.59 % (16655)------------------------------
% 0.19/0.59 % (16672)First to succeed.
% 0.19/0.60 % (16672)Refutation found. Thanks to Tanya!
% 0.19/0.60 % SZS status Theorem for theBenchmark
% 0.19/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.60 % (16672)------------------------------
% 0.19/0.60 % (16672)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.60 % (16672)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.60 % (16672)Termination reason: Refutation
% 0.19/0.60
% 0.19/0.60 % (16672)Memory used [KB]: 5628
% 0.19/0.60 % (16672)Time elapsed: 0.097 s
% 0.19/0.60 % (16672)Instructions burned: 10 (million)
% 0.19/0.60 % (16672)------------------------------
% 0.19/0.60 % (16672)------------------------------
% 0.19/0.60 % (16647)Success in time 0.247 s
%------------------------------------------------------------------------------