TSTP Solution File: SET017-6 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET017-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n005.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 : Tue May 21 03:07:46 EDT 2024
% Result : Unsatisfiable 0.61s 0.79s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 31 ( 12 unt; 0 def)
% Number of atoms : 52 ( 9 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 44 ( 23 ~; 19 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f184,plain,
$false,
inference(avatar_sat_refutation,[],[f113,f127,f183]) ).
fof(f183,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f182]) ).
fof(f182,plain,
( $false
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f179,f158]) ).
fof(f158,plain,
( ~ member(y,universal_class)
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f155,f137]) ).
fof(f137,plain,
( ~ member(y,unordered_pair(x,x))
| ~ spl0_2 ),
inference(backward_demodulation,[],[f117,f130]) ).
fof(f130,plain,
( x = z
| ~ spl0_2 ),
inference(unit_resulting_resolution,[],[f94,f112,f8]) ).
fof(f8,axiom,
! [X2,X0,X1] :
( ~ member(X2,unordered_pair(X0,X1))
| X0 = X2
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_member) ).
fof(f112,plain,
( member(z,unordered_pair(x,y))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f110,plain,
( spl0_2
<=> member(z,unordered_pair(x,y)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f94,axiom,
y != z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_left_cancellation_3) ).
fof(f117,plain,
~ member(y,unordered_pair(z,z)),
inference(unit_resulting_resolution,[],[f94,f94,f8]) ).
fof(f155,plain,
( member(y,unordered_pair(x,x))
| ~ member(y,universal_class)
| ~ spl0_2 ),
inference(superposition,[],[f10,f131]) ).
fof(f131,plain,
( unordered_pair(x,y) = unordered_pair(x,x)
| ~ spl0_2 ),
inference(backward_demodulation,[],[f92,f130]) ).
fof(f92,axiom,
unordered_pair(x,y) = unordered_pair(x,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_left_cancellation_1) ).
fof(f10,axiom,
! [X0,X1] :
( member(X1,unordered_pair(X0,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair3) ).
fof(f179,plain,
( member(y,universal_class)
| ~ spl0_2 ),
inference(unit_resulting_resolution,[],[f133,f99]) ).
fof(f99,plain,
! [X2,X3,X0,X1] :
( ~ member(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(X3,X3))),cross_product(X0,X1))
| member(X2,X0) ),
inference(definition_unfolding,[],[f14,f95]) ).
fof(f95,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f13,f12,f12]) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_set) ).
fof(f13,axiom,
! [X0,X1] : unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))) = ordered_pair(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair) ).
fof(f14,axiom,
! [X2,X3,X0,X1] :
( member(X2,X0)
| ~ member(ordered_pair(X2,X3),cross_product(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cartesian_product1) ).
fof(f133,plain,
( member(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(x,x))),cross_product(universal_class,universal_class))
| ~ spl0_2 ),
inference(backward_demodulation,[],[f96,f130]) ).
fof(f96,plain,
member(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))),cross_product(universal_class,universal_class)),
inference(definition_unfolding,[],[f93,f95]) ).
fof(f93,axiom,
member(ordered_pair(y,z),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_left_cancellation_2) ).
fof(f127,plain,
spl0_1,
inference(avatar_split_clause,[],[f122,f106]) ).
fof(f106,plain,
( spl0_1
<=> member(z,universal_class) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f122,plain,
member(z,universal_class),
inference(unit_resulting_resolution,[],[f96,f98]) ).
fof(f98,plain,
! [X2,X3,X0,X1] :
( ~ member(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(X3,X3))),cross_product(X0,X1))
| member(X3,X1) ),
inference(definition_unfolding,[],[f15,f95]) ).
fof(f15,axiom,
! [X2,X3,X0,X1] :
( member(X3,X1)
| ~ member(ordered_pair(X2,X3),cross_product(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cartesian_product2) ).
fof(f113,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f104,f110,f106]) ).
fof(f104,plain,
( member(z,unordered_pair(x,y))
| ~ member(z,universal_class) ),
inference(superposition,[],[f10,f92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SET017-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.08/0.16 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.37 % Computer : n005.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 20 13:25:38 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.16/0.37 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.61/0.78 % (16292)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.61/0.78 % (16285)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.61/0.78 % (16286)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.61/0.78 % (16292)Refutation not found, incomplete strategy% (16292)------------------------------
% 0.61/0.78 % (16292)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.78 % (16292)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.78
% 0.61/0.78 % (16292)Memory used [KB]: 1078
% 0.61/0.78 % (16292)Time elapsed: 0.004 s
% 0.61/0.78 % (16292)Instructions burned: 3 (million)
% 0.61/0.78 % (16292)------------------------------
% 0.61/0.78 % (16292)------------------------------
% 0.61/0.78 % (16291)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.61/0.78 % (16293)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2995ds/55Mi)
% 0.61/0.78 % (16288)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.61/0.79 % (16290)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.61/0.79 % (16293)First to succeed.
% 0.61/0.79 % (16289)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.61/0.79 % (16293)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-16283"
% 0.61/0.79 % (16293)Refutation found. Thanks to Tanya!
% 0.61/0.79 % SZS status Unsatisfiable for theBenchmark
% 0.61/0.79 % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.79 % (16293)------------------------------
% 0.61/0.79 % (16293)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.79 % (16293)Termination reason: Refutation
% 0.61/0.79
% 0.61/0.79 % (16293)Memory used [KB]: 1119
% 0.61/0.79 % (16293)Time elapsed: 0.006 s
% 0.61/0.79 % (16293)Instructions burned: 8 (million)
% 0.61/0.79 % (16283)Success in time 0.424 s
% 0.61/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------